Sorting, Approximate Sorting, and Searching in Rounds

DOI10.1137/0401028MaRDI QIDQ3802637zbMATH OpenOpenAlexFDO

Authors Noga Alon, Yossi Azar

Publication date 1988

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0401028

zbMATH Keywords

approximate sortingmedianparallel algorithmssearchingsorting in rounds

Mathematics Subject Classification ID

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

Recommendations

• Sorting and Selecting in Rounds
• Sorting in rounds
• Probabilistic Parallel Algorithms for Sorting and Selection
• Approximate Sorting
• Approximate Sorting

Cited in

(16)

• Sorting in rounds
• An introduction to three algorithms for sorting in situ
• Constant time parallel sorting: An empirical view.
• Approximate minimum selection with unreliable comparisons
• Method for approximation of diverse individual sorting rules
• Sorting and Selecting in Rounds
• scientific article; zbMATH DE number 22189 (Why is no real title available?)
• The acyclic orientation game on random graphs
• Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
• On the Complexity of Approximate Sum of Sorted List
• Approximate Sorting
• LATIN 2004: Theoretical Informatics
• Approximate Sorting
• Parallel comparison merging of many-ordered lists
• Parallel comparison algorithms for approximation problems
• Parallel selection

This page was built for publication: Sorting, Approximate Sorting, and Searching in Rounds

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