Self-stabilizing population protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Storage capacity of labeled graphs
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Flat holonomies on automata networks
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Stably computable properties of network graphs
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Adaptive stabilization of reactive protocols
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Self-stabilizing population protocols
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Effective storage capacity of labeled graphs
Information and Computation
| Hi-index | 0.00 |
We consider asynchronous general topology dynamic networks of identical nameless nodes with worst-case transient faults. Starting from any faulty configuration, our protocols self-stabilize any computation in time polynomial in the (unknown) network diameter. This version sacrifices some diversity of tasks and efficiency for simplicity and clarity of details. Appendix gives more efficient procedures in less detail.