Parallel Merge Sort
- 1 August 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (4), 770-785
- https://doi.org/10.1137/0217049
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Faster optimal parallel prefix sums and list rankingInformation and Computation, 1989
- Optimal slope selectionLecture Notes in Computer Science, 1988
- Tight Comparison Bounds on the Complexity of Parallel SortingSIAM Journal on Computing, 1987
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- Partitioning point sets in arbitrary dimensionTheoretical Computer Science, 1987
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- Searching, Merging, and Sorting in Parallel ComputationIEEE Transactions on Computers, 1983
- Sorting inc logn parallel stepsCombinatorica, 1983
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978