Lower bound for scalable Byzantine agreement
From MaRDI portal
Publication:2377258
DOI10.1007/s00446-008-0069-xzbMath1267.68068OpenAlexW2034109654MaRDI QIDQ2377258
Dan Holtby, Valerie King, Bruce M. Kapron
Publication date: 28 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-008-0069-x
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Cites Work
- A lower bound for the time to assure interactive consistency
- Perfect information leader election in \(\log^*n+O(1)\) rounds
- A tight lower bound for randomized synchronous consensus
- Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
- Scalable leader election
- Fault Tolerance in Networks of Bounded Degree
- The Byzantine Generals Problem
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement