Fast deterministic selection on mesh-connected processor arrays

DOI10.1007/BF01961542zbMath0843.68041OpenAlexW2055350585MaRDI QIDQ1911464

Danny Krizanc, Lata Narayanan, Rajeev Raman

Publication date: 28 April 1996

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01961542

zbMATH Keywords

processor arraysMesh-connected

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (1)

An efficient selection algorithm on the pyramid

Cites Work

• Unnamed Item
• Parallel selection
• An optimally efficient selection algorithm
• Optimal parallel selection has complexity O(log log N)
• Optimal routing algorithms for mesh-connected processor arrays
• Time bounds for selection
• Probabilistic Parallel Algorithms for Sorting and Selection
• Parallelism in Comparison Problems
• Sorting on a mesh-connected parallel computer

This page was built for publication: Fast deterministic selection on mesh-connected processor arrays