Parallel quicksort
- 1 April 1991
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 11 (4) , 332-337
- https://doi.org/10.1016/0743-7315(91)90040-g
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Hybridsort revisited and parallelizedInformation Processing Letters, 1989
- A simple parallel tree contraction algorithmJournal of Algorithms, 1989
- Parallel iterated bucket sortInformation Processing Letters, 1989
- Parallel Merge SortSIAM Journal on Computing, 1988
- Towards optimal parallel bucket sortingInformation and Computation, 1987
- Branching processes in the analysis of the heights of treesActa Informatica, 1987
- A note on the height of binary search treesJournal of the ACM, 1986
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Optimal parallel algorithms for computing convex hulls and for sortingComputing, 1984
- Sorting inc logn parallel stepsCombinatorica, 1983