Sorting in one round

DOI10.1007/BF02761857zbMath0461.05039OpenAlexW2026729827MaRDI QIDQ1152382

Moshe Rosenfeld, Béla Bollobás

Publication date: 1981

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02761857

zbMATH Keywords

sortingorientationprobabilistic methodtransitive closure

Mathematics Subject Classification ID

Searching and sorting (68P10) Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Sorting in rounds ⋮ Constant time parallel sorting: An empirical view. ⋮ Finding an Unknown Acyclic Orientation of a Given Graph ⋮ Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory ⋮ Graphs whose every transitive orientation contains almost every relation ⋮ Parallel sorting ⋮ Parallel comparison algorithms for approximation problems ⋮ Sorting and Merging in Rounds

Cites Work

• Parallel Sorting with Constant Time for Comparisons
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sorting in one round