Finding the maximum, merging, and sorting in a parallel computation model
- 31 March 1981
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 2 (1), 88-102
- https://doi.org/10.1016/0196-6774(81)90010-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Computing connected components on parallel computersCommunications of the ACM, 1979
- A Survey of Parallel Algorithms in Numerical Linear AlgebraSIAM Review, 1978
- Fast parallel sorting algorithmsCommunications of the ACM, 1978
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978
- Parallel Computations in Graph TheorySIAM Journal on Computing, 1978
- Merging with parallel processorsCommunications of the ACM, 1975
- On the Parallel Evaluation of Certain Arithmetic ExpressionsJournal of the ACM, 1975
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975
- Parallelism in tape-sortingCommunications of the ACM, 1974