Sorting in one round

DOI10.1007/BF02761857MaRDI QIDQ1152382zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Moshe Rosenfeld

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

orientationprobabilistic methodsortingtransitive closure

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3637904 (Why is no real title available?)
• scientific article; zbMATH DE number 3409355 (Why is no real title available?)
• Parallel Sorting with Constant Time for Comparisons

Cited in

(8)

• Sorting in rounds
• Constant time parallel sorting: An empirical view.
• Parallel sorting
• Finding an unknown acyclic orientation of a given graph
• Sorting and Merging in Rounds
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• Graphs whose every transitive orientation contains almost every relation
• Parallel comparison algorithms for approximation problems

This page was built for publication: Sorting in one round

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