Distributed algorithms for finding centers and medians in networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
Lower Bounds for Distributed Maximum-Finding Algorithms
Journal of the ACM (JACM)
A fully distributed (minimal) spanning tree algorithm
Information Processing Letters
Computer networks
A compositional approach to superimposition
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Time and message bounds for election in synchronous and asynchronous complete networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Decentralized extrema-finding in circular configurations of processors
Communications of the ACM
Graph Algorithms
Election and traversal in unidirectional networks
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
The impact of synchronous communication on the problem of electing a leader in a ring
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Distributed elections in an archimedean ring of processors
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Graph learning with a nearest neighbor approach
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Optimal Elections in Faulty Loop Networks and Applications
IEEE Transactions on Computers
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Information Dissemination in Distributed Systems with Faulty Units
IEEE Transactions on Computers
Analyzing Expected Time by Scheduler-Luck Games
IEEE Transactions on Software Engineering
Yet Another Modular Technique for Efficient Leader Election
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Cooperating Mobile Agents and Stabilization
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Sense of direction in distributed computing
Theoretical Computer Science - Special issue: Distributed computing
Design and analysis of dynamic leader election protocols in broadcast networks
Distributed Computing
Controller and estimator for dynamic networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
Linear election in pancake graphs
Information Processing Letters
Clustering of wireless sensor and actor networks based on sensor distribution and connectivity
Journal of Parallel and Distributed Computing
Fault-tolerant simulation of message-passing algorithms by mobile agents
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Easy and hard testbeds for real-time search algorithms
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Efficient goal-directed exploration
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
On the message complexity of global computations
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Improved distributed exploration of anonymous networks
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Self-stabilizing leader election for single-hop wireless networks despite jamming
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Distributed exploration of an unknown graph
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Effective elections for anonymous mobile agents
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Exploiting a meeting channel to interconnect mobile robots
Journal of Network and Computer Applications
Controller and estimator for dynamic networks
Information and Computation
Hi-index | 0.01 |
A general, modular technique for designing efficient leader finding algorithms in distributed, asynchronous networks is developed. This technique reduces the problem of efficient leader finding to a simpler problem of efficient serial traversing of the corresponding network. The message complexity of the resulting leader finding algorithms is bounded by [f(n) + n)(log2k + 1) (or (f(m) + n)(log2k + 1)], where n is the number of nodes in the network [m is the number of edges in the network], k is the number of nodes that start the algorithm, and f (n) [f(m)] is the message complexity of traversing the nodes [edges] of the network. The time complexity of these algorithms may be as large as their message complexity. This technique does not require that the FIFO discipline is obeyed by the links. The local memory needed for each node, besides the memory needed for the traversal algorithm, is logarithmic in the maximal identity of a node in the network. This result achieves in a unified way the best known upper bounds on the message complexity of leader finding algorithms for circular, complete, and general networks. It is also shown to be applicable to other classes of networks, and in some cases the message complexity of the resulting algorithms is better by a constant factor than that of previously known algorithms.