Recommendations
Cites work
- Algorithm Theory - SWAT 2004
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
- Continuous consensus via common knowledge
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Programming simultaneous actions using common knowledge
- Reaching Agreement in the Presence of Faults
Cited in
(4)
This page was built for publication: Continuous consensus with ambiguous failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986534)