Parallel sorting
From MaRDI portal
Publication:1837535
DOI10.1016/0166-218X(83)90095-1zbMath0507.68035OpenAlexW4210622426MaRDI QIDQ1837535
Béla Bollobás, Andrew G. 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
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (10)
Search problems: One, two or many rounds ⋮ Dense expanders and pseudo-random bipartite graphs ⋮ Sorting in rounds ⋮ Constant time parallel sorting: An empirical view. ⋮ On partial sorting in restricted rounds ⋮ Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory ⋮ Graphs whose every transitive orientation contains almost every relation ⋮ Pseudo-random hypergraphs ⋮ Parallel comparison merging of many-ordered lists ⋮ Parallel comparison algorithms for approximation problems
Cites Work
This page was built for publication: Parallel sorting
