A parallel bucket sort
From MaRDI portal
Publication:1108803
DOI10.1016/0020-0190(88)90092-0zbMath0654.68067OpenAlexW2091605543MaRDI QIDQ1108803
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(88)90092-0
Related Items (3)
Hybridsort revisited and parallelized ⋮ ERCW PRAMs and optical communication ⋮ Parallel iterated bucket sort
Cites Work
- Unnamed Item
- Sorting in \(c \log n\) parallel steps
- Routing, merging, and sorting on parallel models of computation
- Towards optimal parallel bucket sorting
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Parallel computation and conflicts in memory access
- Parallel Prefix Computation
- Finding the maximum, merging, and sorting in a parallel computation model
- The Parallel Evaluation of General Arithmetic Expressions
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: A parallel bucket sort