Hybridsort revisited and parallelized

DOI10.1016/0020-0190(89)90066-5MaRDI QIDQ1123628zbMATH OpenOpenAlexFDO

Authors 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

hybridsortparallel sortingsorting by distribution

Mathematics Subject Classification ID

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

Recommendations

• An Internal Hybrid Sort Algorithm Revisited
• Sorting in linear time?
• Probabilistic integer sorting
• scientific article; zbMATH DE number 3915640
• Probabilistic Parallel Algorithms for Sorting and Selection

Cites work

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

Cited in

(7)

• Parallel iterated bucket sort
• An improved reliability bound of a probabilistic parallel integer sorting algorithm
• Probabilistic integer sorting
• Approximating Huffman codes in parallel
• scientific article; zbMATH DE number 3915640 (Why is no real title available?)
• An Internal Hybrid Sort Algorithm Revisited
• On parallel integer sorting

This page was built for publication: Hybridsort revisited and parallelized

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123628)