Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers

DOI10.1080/00207160304673zbMath1015.68239OpenAlexW2067669259MaRDI QIDQ4805931

Hong Shen, Yijie Han, Yi Pan, David J. Evans

Publication date: 8 May 2003

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160304673

zbMATH Keywords

multiselectionmesh-connected computers

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items

On computing an optimal permutation of ranks for multiselection

Cites Work

• Unnamed Item
• Unnamed Item
• Refined complexity analysis for heap operations
• A parallel median algorithm
• An optimally efficient selection algorithm
• Improved universal \(k\)-selection in hypercubes
• Finding the median
• Time bounds for selection
• A Unified Lower Bound for Selection and Set Partitioning Problems
• New upper bounds for selection
• Parallel Processing with the Perfect Shuffle