Continuous Consensus with Ambiguous Failures
From MaRDI portal
Recommendations
Cites work
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
- 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
(3)
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 Q5445739)