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