Hybridsort revisited and parallelized

DOI10.1016/0020-0190(89)90066-5zbMath0677.68071OpenAlexW2001039330MaRDI QIDQ1123628

Torben Hagerup

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90066-5

zbMATH Keywords

parallel sortinghybridsortsorting by distribution

Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of operating systems (68N25)

Related Items (5)

Probabilistic integer sorting ⋮ An improved reliability bound of a probabilistic parallel integer sorting algorithm ⋮ Approximating Huffman codes in parallel ⋮ Parallel iterated bucket sort ⋮ On parallel integer sorting

Cites Work

• Sorting in \(c \log n\) parallel steps
• A parallel bucket sort
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• The design and analysis of a new hybrid sorting algorithm
• Parallel iterated bucket sort
• Deterministic coin tossing with applications to optimal parallel list ranking
• Finding the maximum, merging, and sorting in a parallel computation model

This page was built for publication: Hybridsort revisited and parallelized