Exploiting few inversions when sorting: Sequential and parallel algorithms
- 30 August 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 163 (1-2) , 211-238
- https://doi.org/10.1016/0304-3975(95)00256-1
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- An optimal parallel adaptive sorting algorithmInformation Processing Letters, 1991
- Sorting roughly sorted sequences in parallelInformation Processing Letters, 1990
- A guided tour of chernoff boundsInformation Processing Letters, 1990
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory MachinesSIAM Journal on Computing, 1989
- Parallel Merge SortSIAM Journal on Computing, 1988
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic TimeSIAM Journal on Computing, 1988
- Smoothsort's behavior on presorted sequencesInformation Processing Letters, 1983
- Sorting inc logn parallel stepsCombinatorica, 1983
- Smoothsort, an alternative for sorting in situScience of Computer Programming, 1982
- Expected time bounds for selectionCommunications of the ACM, 1975