An optimal parallel adaptive sorting algorithm
- 1 August 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 39 (4) , 195-200
- https://doi.org/10.1016/0020-0190(91)90179-l
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Sorting roughly sorted sequences in parallelInformation Processing Letters, 1990
- A note on adaptive parallel sortingInformation Processing Letters, 1989
- A new measure of presortednessInformation and Computation, 1989
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory MachinesSIAM Journal on Computing, 1989
- Parallel Merge SortSIAM Journal on Computing, 1988
- Exploiting partial order with QuicksortSoftware: Practice and Experience, 1984
- Sorting inc logn parallel stepsCombinatorica, 1983
- Smoothsort, an alternative for sorting in situScience of Computer Programming, 1982
- Best sorting algorithm for nearly sorted listsCommunications of the ACM, 1980
- Parallel Prefix ComputationJournal of the ACM, 1980