Sorting in parallel by double distributive partitioning
- 1 September 1987
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 27 (3) , 340-348
- https://doi.org/10.1007/bf01933729
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Sorting in linear expected timeBIT Numerical Mathematics, 1985
- An Adaptive Method for Unknown Distributions in Distributive Partitioned SortingIEEE Transactions on Computers, 1985
- Parallel distributive partitioned sorting methodsInternational Journal of Computer Mathematics, 1984
- Usort: An efficient hybrid of Distributive Partitioning SortingBIT Numerical Mathematics, 1982
- Average time behavior of distributive sorting algorithmsComputing, 1981
- The design and analysis of a new hybrid sorting algorithmInformation Processing Letters, 1980
- Implementing Quicksort programsCommunications of the ACM, 1978
- Sorting by distributive partitioningInformation Processing Letters, 1978
- Some Computer Organizations and Their EffectivenessIEEE Transactions on Computers, 1972
- Algorithm 64: QuicksortCommunications of the ACM, 1961