Conservative algorithms for parallel and sequential integer sorting
From MaRDI portal
Publication:6085719
DOI10.1007/bfb0030847zbMath1527.68051OpenAlexW1569625216MaRDI QIDQ6085719
Publication date: 12 December 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0030847
analysis of algorithmsparallel algorithmsdesign of algorithmsinteger sortingbucket sortingconservative algorithms
Analysis of algorithms (68W40) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Upper bounds for sorting integers on random access machines
- On parallel integer sorting
- Deterministic parallel list ranking
- Improved nonconservative sequential and parallel integer sorting
- Towards optimal parallel bucket sorting
- Improved deterministic parallel integer sorting
- Parallel Prefix Computation
- Parallelism in Comparison Problems
- New Parallel-Sorting Schemes
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations