Fast consensus in networks of bounded degree.

DOI10.1007/BF02280836zbMath1282.68092MaRDI QIDQ1312604

Juan A. Garay, Piotr Berman

Publication date: 22 November 1995

Published in: Distributed Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Theory of operating systems (68N25)

Related Items (5)

The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Secure Message Transmission by Public Discussion: A Brief Survey ⋮ Unnamed Item ⋮ Distributed agreement in dynamic peer-to-peer networks

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

This page was built for publication: Fast consensus in networks of bounded degree.