Lower bounds for asynchronous consensus
From MaRDI portal
(Redirected from Lower bounds for asynchronous consensus)
Lower bounds for asynchronous consensus (scientific article; zbMATH DE number 1950667)
Lower bounds for asynchronous consensus (scientific article; zbMATH DE number 1950667)
Recommendations
- Lower bounds for asynchronous consensus
- Tight bounds for asynchronous randomized consensus
- Tight bounds for asynchronous randomized consensus
- Two lower bounds in asynchronous distributed computation
- Lower bound for scalable Byzantine agreement
- Lower bound for scalable Byzantine agreement
- A simple proof of the uniform consensus synchronous lower bound.
- scientific article; zbMATH DE number 1559571
- Lower bounds for randomized consensus under a weak adversary
- Lower bounds for randomized consensus under a weak adversary
Cited in
(10)- A bivalency proof of the lower bound for uniform consensus
- Lower bound on the step complexity of anonymous binary consensus
- Lower bounds for asynchronous consensus
- Cutoff bounds for consensus algorithms
- Bosco: One-Step Byzantine Asynchronous Consensus
- A new synchronous lower bound for set agreement
- scientific article; zbMATH DE number 7561259 (Why is no real title available?)
- Theory of Cryptography
- Synchronous consensus under hybrid process and link failures
- Refined quorum systems
This page was built for publication: Lower bounds for asynchronous consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4413396)