An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
Lower Bounds for Distributed Maximum-Finding Algorithms
Journal of the ACM (JACM)
Electing a leader in a synchronous ring
Journal of the ACM (JACM)
The effects of link failures on computations in asynchronous rings
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Computing on an anonymous ring
Journal of the ACM (JACM)
Virtual rings: an introduction to concurrency
ACM SIGCSE Bulletin
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
IEEE Transactions on Computers
A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A modular technique for the design of efficient distributed leader finding algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Improvements in the time complexity of two message-optimal election algorithms
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)
On an improved algorithm for decentralized extrema finding in circular configurations of processors
Communications of the ACM
Technical correspondence: on message passes in computer networks.
Communications of the ACM
technical correspondence: on message passes in computer networks. author's response
Communications of the ACM
A Resilient Mutual Exclusion Algorithm for Computer Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal Resilient Distributed Algorithms for Ring Election
IEEE Transactions on Parallel and Distributed Systems
Dynamic Synchrony Among Atomic Actions
IEEE Transactions on Parallel and Distributed Systems
Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
An Improved Algorithm for Subdivision Traversal without Extra Storage
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Finding an extremum in a network
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of 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
Exact communication costs for consensus and leader in a tree
Journal of Discrete Algorithms
Leader election in rings with nonunique labels
Fundamenta Informaticae
On the complexity of computation in the presence of link failures: the case of a ring
Distributed Computing
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Cost distribution of the Chang-Roberts leader election algorithm and related problems
Theoretical Computer Science
Finding Maximum on an Array Processor with a Global Bus
IEEE Transactions on Computers
Bit complexity of breaking and achieving symmetry in chains and rings
Journal of the ACM (JACM)
Two novel algorithms for electing coordinator in distributed systems basedon bully algorithm
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Computing on a partially eponymous ring
Theoretical Computer Science
Minuet: rethinking concurrency control in storage area networks
FAST '09 Proccedings of the 7th conference on File and storage technologies
Simplifying Itai-Rodeh Leader Election for Anonymous Rings
Electronic Notes in Theoretical Computer Science (ENTCS)
Maintaining a ring structure for mobile ad hoc computing
Journal of Parallel and Distributed Computing
Optimal moves for gossiping among mobile agents
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
How much memory is needed for leader election
DISC'10 Proceedings of the 24th international conference on Distributed computing
Some problems in distributed computational geometry
Theoretical Computer Science
Secure random number generation in wireless sensor networks
Proceedings of the 4th international conference on Security of information and networks
Verification techniques for distributed algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Computing on a partially eponymous ring
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Fair leader election by randomized voting
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Distributed tree comparison with nodes of limited memory
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Leader Election in Rings with Nonunique Labels
Fundamenta Informaticae
From clarity to efficiency for distributed algorithms
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Knowledge, level of symmetry, and time of leader election
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Learning a ring cheaply and fast
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 48.30 |
This note presents an efficient algorithm, requiring O(n log n) message passes, for finding the largest (or smallest) of a set of n uniquely numbered processors arranged in a circle, in which no central controller exists and the number of processors is not known a priori.