On the expected complexity of distributed selection
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
On the expected complexity of distributed selection
Journal of Parallel and Distributed Computing
Distributed k-selection: From a sequential to a distributed algorithm
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Tradeoffs for selection in distributed networks (Preliminary Version)
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Efficient Distributed Selection with Bounded Messages
IEEE Transactions on Parallel and Distributed Systems
Tight bounds for distributed selection
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
| Hi-index | 14.98 |
The problem of selecting the Kth smallest element of a set of N elements distributed among d sites of a communication network is examined. A reduction technique is a distributed algorithm that transforms this problem to an equivalent one where either K or N (or both) are reduced. A collection of distributed reduction techniques is presented; the combined use of the algorithms offers new solutions for the selection problem in shout-echo networks and in a class of point-to-point networks. The communication complexity of these solutions is analyzed and shown to represent an improvement on the multiplicative constant of existing bounds for those networks.