Efficient parallel k selection algorithm
From MaRDI portal
Publication:912623
DOI10.1016/0020-0190(90)90034-UzbMath0698.68049MaRDI QIDQ912623
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90034-u
68Q25: Analysis of algorithms and problem complexity
68N25: Theory of operating systems
68N99: Theory of software
Related Items
Fault-tolerant parallel \(k\) selection algorithm in \(n\)-cube networks, Optimal parallel construction of heaps
Cites Work
- Selection of the first k largest processes in hypercubes
- Parallel Merge Sort
- Decentralized extrema-finding in circular configurations of processors
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circle