A parallel bucket sort
- 29 February 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 27 (2) , 57-61
- https://doi.org/10.1016/0020-0190(88)90092-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Parallel computation and conflicts in memory accessInformation Processing Letters, 1982
- A fast probabilistic parallel sorting algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- Parallel Prefix ComputationJournal of the ACM, 1980
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952