Bit complexity of order statistics on a distributed star network

DOI10.1016/0020-0190(89)90130-0zbMath0665.68035OpenAlexW2036481673MaRDI QIDQ1116337

Ornan Gerstel, Yishay Mansour, Shmuel Zaks

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90130-0

zbMATH Keywords

order statisticsrankingsortingselectionlower boundbit complexityasynchronous distributed star network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of software (68N99)

Cites Work

• Unnamed Item
• The bit complexity of distributed sorting
• Distributed Sorting
• Optimal Distributed Algorithms for Sorting and Ranking
• The complexity of sorting on distributed systems

This page was built for publication: Bit complexity of order statistics on a distributed star network