Optimal Distributed Algorithms for Sorting and Ranking

DOI10.1109/TC.1985.5009390zbMath0556.68026OpenAlexW2016240806MaRDI QIDQ3219776

Shmuel Zaks

Publication date: 1985

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1985.5009390

zbMATH Keywords

rankingsortingdistributed algorithmsmessage complexitynetwork of processors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25)

Related Items (6)

Bit complexity of order statistics on a distributed star network ⋮ Circular motion of multiple nonholonomic robots under switching topology with ordinal ranking ⋮ SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS ⋮ A distributed selection algorithm and its expected communication complexity ⋮ Message lower bounds via efficient network synchronization ⋮ A time-optimal distributed sorting algorithm on a line network.

This page was built for publication: Optimal Distributed Algorithms for Sorting and Ranking