Memory space requirements for self-stabilizing leader election protocols
- 1 May 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 199-207
- https://doi.org/10.1145/301308.301358
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Uniform and self-stabilizing token rings allowing unfair daemonIEEE Transactions on Parallel and Distributed Systems, 1997
- Memory requirements for silent stabilizationPublished by Association for Computing Machinery (ACM) ,1996
- Distributed resetIEEE Transactions on Computers, 1994
- Memory-efficient and self-stabilizing network RESET (extended abstract)Published by Association for Computing Machinery (ACM) ,1994
- Self-stabilizing symmetry breaking in constant-space (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- Token management schemes and random walks yield self-stabilizing mutual exclusionPublished by Association for Computing Machinery (ACM) ,1990
- Probabilistic self-stabilizationInformation Processing Letters, 1990
- Uniform self-stabilizing ringsACM Transactions on Programming Languages and Systems, 1989
- Self-Stabilization in Spite of Distributed ControlPublished by Springer Nature ,1982
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974