Sorting roughly sorted sequences in parallel
- 10 February 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 33 (6) , 297-300
- https://doi.org/10.1016/0020-0190(90)90212-g
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Parallel Merge SortSIAM Journal on Computing, 1988
- Tight Comparison Bounds on the Complexity of Parallel SortingSIAM Journal on Computing, 1987
- Measures of Presortedness and Optimal Sorting AlgorithmsIEEE Transactions on Computers, 1985
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Sorting inc logn parallel stepsCombinatorica, 1983
- Parallel Prefix ComputationJournal of the ACM, 1980
- Sorting presorted filesPublished by Springer Nature ,1979