Self-stabilizing indulgent zero-degrading binary consensus
From MaRDI portal
Publication:6201321
DOI10.1016/j.tcs.2024.114387arXiv2010.05489OpenAlexW3093437085WikidataQ130190540 ScholiaQ130190540MaRDI QIDQ6201321
Michel Raynal, Oskar Lundström, Elad M. Schiller
Publication date: 20 February 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.05489
Cites Work
- Unnamed Item
- Unnamed Item
- Using asynchrony and zero degradation to speed up indulgent consensus protocols
- Practically-self-stabilizing virtual synchrony
- Self-stabilizing group communication in directed networks
- A simple proof of the uniform consensus synchronous lower bound.
- When consensus meets self-stabilization
- Self-stabilizing Byzantine-tolerant distributed replicated state machine
- Practically stabilizing SWMR atomic memory in message-passing systems
- Fast self-stabilizing byzantine tolerant digital clock synchronization
- On implementing omega with weak reliability and synchrony assumptions
- Self-stabilizing clock synchronization in the presence of Byzantine faults
- Impossibility of distributed consensus with one faulty process
- Self-stabilizing systems in spite of distributed control
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors
- Introduction to Distributed Algorithms
- Indulgent algorithms (preliminary version)
- Fault-Tolerant Message-Passing Distributed Systems
- On the Possibility and the Impossibility of Message-Driven Self-stabilizing Failure Detection
- Introduction to Distributed Self-Stabilizing Algorithms
- Communication-efficient leader election and consensus with limited link synchrony
- Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
This page was built for publication: Self-stabilizing indulgent zero-degrading binary consensus
