On the expected complexity of distributed selection
Journal of Parallel and Distributed Computing
Bit complexity of order statistics on a distributed star network
Information Processing Letters
PC/Computing
Reduction Techniques for Selection in Distributed Files
IEEE Transactions on Computers
A distributed selection algorithm and its expected communication complexity
Theoretical Computer Science
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
A note on efficient aggregate queries in sensor networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed multiple selection algorithm for peer-to-peer systems
Journal of Systems and Software
A note on efficient aggregate queries in sensor networks
Theoretical Computer Science
Tight bounds for distributed selection
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Distributed selection: a missing piece of data aggregation
Communications of the ACM - Enterprise information integration: and other tools for merging data
The complexity of data aggregation in directed networks
DISC'11 Proceedings of the 25th international conference on Distributed computing
Distributed computing in fault-prone dynamic networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
| Hi-index | 0.00 |
We consider the problem of selecting the Kth smallest element of a set distributed among the sites of a communication network when the size of messages is bounded; that is, each message is a packet which contains at most c bits, where c驴 1 is a constant.A general selection algorithm using packets is presented and its packet complexity is analyzed. Its complexity is shown to be a significant improvement for a large range of packet sizes over the existing bounds. The proposed technique is then instanciated for specific classes of network topologies; the resulting bounds either match or improve the ones of existing solutions for a large range of values of the packet size. Furthermore, it is bit optimal in star networks.