Tight Comparison Bounds on the Complexity of Parallel Sorting
- 1 June 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 16 (3) , 458-464
- https://doi.org/10.1137/0216032
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Sorting and GraphsPublished by Springer Nature ,1985
- Searching, Merging, and Sorting in Parallel ComputationIEEE Transactions on Computers, 1983
- Parallel sortingDiscrete Applied Mathematics, 1983
- Sorting inc logn parallel stepsCombinatorica, 1983
- Sorting and Merging in RoundsSIAM Journal on Algebraic Discrete Methods, 1982
- Parallel Sorting with Constant Time for ComparisonsSIAM Journal on Computing, 1981
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- Sorting in one roundIsrael Journal of Mathematics, 1981
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975