Leader Election in Anonymous Rings: Franklin Goes Probabilistic
Open Access
- 1 January 2008
- book chapter
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on ringsDistributed Computing, 2007
- Self-stabilizing Population ProtocolsLecture Notes in Computer Science, 2006
- Distributed Branching Bisimulation Reduction of State SpacesElectronic Notes in Theoretical Computer Science, 2003
- State Space Reduction by Proving ConfluenceLecture Notes in Computer Science, 2002
- µCRL: A Toolset for Analysing Algebraic SpecificationsLecture Notes in Computer Science, 2001
- Memory space requirements for self-stabilizing leader election protocolsPublished by Association for Computing Machinery (ACM) ,1999
- Uniform self-stabilizing ringsACM Transactions on Programming Languages and Systems, 1989
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circleJournal of Algorithms, 1982
- An improved algorithm for decentralized extrema-finding in circular configurations of processesCommunications of the ACM, 1979
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974