Parallel complexity of sorting problems

DOI10.1016/0196-6774(82)90010-4MaRDI QIDQ3339300zbMATH OpenOpenAlexFDO

Authors Martin Aigner

Publication date 1982

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(82)90010-4

zbMATH Keywords

bounds for the cost functionsmerging problemparallel complexityselection problemsorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Tight Comparison Bounds on the Complexity of Parallel Sorting
• Sorting in Parallel
• The Complexity of Parallel Sorting
• Probabilistic Parallel Algorithms for Sorting and Selection
• Routing, merging, and sorting on parallel models of computation

Cited in

(18)

• Notes on the complexity of sorting in abstract machines
• Producing posets
• Parallel algorithms for partitioning sorted sets and related problems
• Peculiarities of the parallel sorting algorithm with rank formation
• A neural sorting network with O(1) time complexity
• Space and time complexities of balanced sorting on processor arrays
• Tight Bounds on the Complexity of Parallel Sorting
• The Mayor's dilemma
• A parallel sorting scheme whose basic operation sortsN elements
• Conway's parallel sorting algorithm
• scientific article; zbMATH DE number 4031004 (Why is no real title available?)
• Sorting in Parallel
• Parallelism in tape-sorting
• scientific article; zbMATH DE number 1419211 (Why is no real title available?)
• Recursively divisible problems
• A new parallel sorting algorithm based upon min-mid-max operations
• Parallel comparison algorithms for approximation problems
• Parallel sorting with cooperating heaps in a linear array of processors

This page was built for publication: Parallel complexity of sorting problems

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