Loosely-Stabilizing Leader Election in Population Protocol Model
From MaRDI portal
Publication:3408179
DOI10.1007/978-3-642-11476-2_23zbMath1274.68017MaRDI QIDQ3408179
Hirotsugu Kakugawa, Fukuhito Ooshita, Yukiko Yamauchi, Toshimitsu Masuzawa, Yuichi Sudo, Junya Nakamura
Publication date: 24 February 2010
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_23
68M12: Network protocols
Related Items
A combinatorial characterization of self-stabilizing population protocols, Polylogarithmic-Time Leader Election in Population Protocols
Cites Work
- Quasi-self-stabilization of a distributed system assuming read/write atomicity
- Computation in networks of passively mobile finite-state sensors
- Weak vs. Self vs. Probabilistic Stabilization
- Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents
- Fast Computation by Population Protocols with a Leader
- Self-stabilizing systems in spite of distributed control
- Probability and Computing
- Unnamed Item