Parallel sorting

DOI10.1016/0166-218X(83)90095-1MaRDI QIDQ1837535zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Andrew Thomason

Publication date 1983

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(83)90095-1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Cites work

• scientific article; zbMATH DE number 3735871 (Why is no real title available?)
• scientific article; zbMATH DE number 45992 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Parallel Sorting with Constant Time for Comparisons
• Sorting and Merging in Rounds
• Sorting in one round

Cited in

(10)

• Constant time parallel sorting: An empirical view.
• Graphs whose every transitive orientation contains almost every relation
• Pseudo-random hypergraphs
• Search problems: One, two or many rounds
• Parallel comparison merging of many-ordered lists
• Dense expanders and pseudo-random bipartite graphs
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• Sorting in rounds
• On partial sorting in restricted rounds
• Parallel comparison algorithms for approximation problems

This page was built for publication: Parallel sorting

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