The average-case parallel complexity of sorting
- 30 November 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 33 (3) , 145-146
- https://doi.org/10.1016/0020-0190(89)90194-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting AlgorithmsSIAM Journal on Computing, 1988
- Tight Comparison Bounds on the Complexity of Parallel SortingSIAM Journal on Computing, 1987
- The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring ProblemSIAM Journal on Computing, 1984
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948