Bit complexity of order statistics on a distributed star network

O. Gerstel, Y. Mansour, S. Zaks

Research output: Contribution to journalArticlepeer-review


We study the bit complexity of order statistics problem on an asynchronous distributed star network. We prove a lower bound ofΩ(N log( L N)) bits for the k-selection problem, and lower bounds of Ω(N log(L - N)) bits for the problems of sorting and ranking. For each of the problems we introduce an algorithm that achieves that bound, thus showing all bounds to be optimal.

Original languageEnglish
Pages (from-to)127-132
Number of pages6
JournalInformation Processing Letters
Issue number3
StatePublished - 13 Feb 1989
Externally publishedYes


  • Complexity
  • distributed star network


Dive into the research topics of 'Bit complexity of order statistics on a distributed star network'. Together they form a unique fingerprint.

Cite this