The complexity of sorting on distributed systems
Open Access
- 31 March 1984
- journal article
- Published by Elsevier in Information and Control
- Vol. 60 (1-3) , 70-85
- https://doi.org/10.1016/s0019-9958(84)80022-4
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circlePublished by Elsevier ,2004
- Communication complexityJournal of Computer and System Sciences, 1984
- Information Transfer in Distributed Computing with Applications to VLSIJournal of the ACM, 1984
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983
- Distributed computation on graphsCommunications of the ACM, 1982
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema ProblemACM Transactions on Programming Languages and Systems, 1982
- Finding the median distributivelyJournal of Computer and System Sciences, 1982
- Communication Issues in the Design and Analysis of Parallel AlgorithmsIEEE Transactions on Software Engineering, 1981
- Lower Bounds on Information Transfer in Distributed ComputationsJournal of the ACM, 1980
- Bitonic Sort on a Mesh-Connected Parallel ComputerIEEE Transactions on Computers, 1979