Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
From MaRDI portal
Publication:1741967
DOI10.1007/s00446-017-0294-2zbMath1451.68036arXiv1401.4972OpenAlexW1529640672WikidataQ115606770 ScholiaQ115606770MaRDI QIDQ1741967
Publication date: 11 April 2018
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.4972
Related Items (3)
Self-stabilizing systems in spite of high dynamics ⋮ Analysis of a memory-efficient self-stabilizing BFS spanning tree construction ⋮ Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error-detecting codes and fault-containing self-stabilization
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST
- Self-stabilizing leader election in optimal space under an arbitrary scheduler
- Self-stabilizing ring orientation using constant space
- Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
- A state-based model of sensor protocols
- The Austin Protocol Compiler.
- Memory requirements for silent stabilization
- Transient fault detectors
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
- Uniform self-stabilizing ring orientation
- Memory space requirements for self-stabilizing leader election protocols
- Self-Stabilizing Symmetry Breaking in Constant Space
- Self-stabilizing systems in spite of distributed control
- Resource Bounds for Self-Stabilizing Message-Driven Protocols
- Distributed reset
- Memory-efficient and self-stabilizing network RESET (extended abstract)
This page was built for publication: Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
