Fast consensus in networks of bounded degree.
From MaRDI portal
Publication:1312604
DOI10.1007/BF02280836zbMath1282.68092MaRDI QIDQ1312604
Publication date: 22 November 1995
Published in: Distributed Computing (Search for Journal in Brave)
Related Items
Unnamed Item, Must the communication graph of MPC protocols be an expander?, Distributed agreement in dynamic peer-to-peer networks, Secure Message Transmission by Public Discussion: A Brief Survey, The Cost of Fault Tolerance in Multi-Party Communication Complexity
Cites Work
- Unnamed Item
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity
- Atomic broadcast: From simple message diffusion to Byzantine agreement
- Bounds on information exchange for Byzantine agreement
- Fault Tolerance in Networks of Bounded Degree
- Reaching Agreement in the Presence of Faults
- The Byzantine generals strike again
- Tolerating linear number of faults in networks of bounded degree