Fast parallel sorting algorithms

DOI10.1145/359576.359582MaRDI QIDQ4162670zbMATH OpenOpenAlexFDO

Authors Daniel S. Hirschberg

Publication date 1978

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/359576.359582

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25)

Cited in

(17)

• A parallel sorting scheme whose basic operation sortsN elements
• Towards optimal parallel bucket sorting
• A unified \(O(\log N)\) and optimal sorting vector algorithm
• Deterministic P-RAM simulation with constant redundancy
• A parallel-design distributed-implementation (PDDI) general-purpose computer
• A parallel algorithm for generating combinations
• Parallel search algorithms for graphs and trees
• A general class of resource tradeoffs
• An adaptive and cost-optimal parallel algorithm for minimum spanning trees
• An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs
• Parallel algorithms for a depth first search and a breadth first search
• Parallelization alternatives and their performance for the convex hull problem
• A new parallel sorting algorithm based upon min-mid-max operations
• A parallel selection algorithm
• Linear sorting with O(log n) processors
• A VLSI algorithm for sorting variable-length character strings
• Parallel iterated bucket sort

This page was built for publication: Fast parallel sorting algorithms

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