Communication-Efficient Parallel Sorting
From MaRDI portal
Publication:4268890
DOI10.1137/S0097539795294141zbMath0939.68166MaRDI QIDQ4268890
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Equivalence classes and conditional hardness in massively parallel computations, Unnamed Item, A randomized sorting algorithm on the BSP model, An architecture independent study of parallel segment trees, Unnamed Item, Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC