Fast distributed construction of k-dominating sets and applications
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Distributed MST for constant diameter graphs
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A Probabilistically Correct Leader Election Protocol for Large Groups
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An efficient leader election protocol for mobile networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Time-efficient distributed layer-2 auto-configuration for cognitive radio networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A Leader Election Algorithm Within Candidates on Ad Hoc Mobile Networks
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
Distributed Disaster Disclosure
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Key Refreshing in Wireless Sensor Networks
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Leader Election in Extremely Unreliable Rings and Complete Networks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Data aggregation in sensor networks: no more a slave to routing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Leader election based on centrality and connectivity measurements in ad hoc networks
KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part I
Fast computation of small cuts via cycle space sampling
ACM Transactions on Algorithms (TALG)
Fast information spreading in graphs with large weak conductance
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the complexity of universal leader election
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.01 |