Continuous consensus with ambiguous failures
From MaRDI portal
Publication:986534
DOI10.1016/J.TCS.2010.04.025zbMath1195.68024OpenAlexW2015140113MaRDI QIDQ986534
Publication date: 11 August 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.025
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Cites Work
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Programming simultaneous actions using common knowledge
- Continuous consensus via common knowledge
- Reaching Agreement in the Presence of Faults
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Algorithm Theory - SWAT 2004
This page was built for publication: Continuous consensus with ambiguous failures