A note on adaptive parallel sorting
- 21 December 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 33 (4) , 187-191
- https://doi.org/10.1016/0020-0190(89)90139-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory MachinesSIAM Journal on Computing, 1989
- Encroaching lists as a measure of presortednessBIT Numerical Mathematics, 1988
- Parallel Merge SortSIAM Journal on Computing, 1988
- Measures of Presortedness and Optimal Sorting AlgorithmsIEEE Transactions on Computers, 1985
- 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
- Some beautiful arguments using mathematical inductionActa Informatica, 1980
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975