Sorting, Approximate Sorting, and Searching in Rounds

DOI10.1137/0401028zbMath0655.68078OpenAlexW2060210427MaRDI QIDQ3802637

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

medianparallel algorithmssearchingapproximate sortingsorting in rounds

Mathematics Subject Classification ID

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

Related Items (5)

Constant time parallel sorting: An empirical view. ⋮ Parallel selection ⋮ The acyclic orientation game on random graphs ⋮ Parallel comparison merging of many-ordered lists ⋮ Parallel comparison algorithms for approximation problems

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