Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds

DOI10.1007/BF01187072zbMath0766.68004WikidataQ57635745 ScholiaQ57635745MaRDI QIDQ4031319

Piotr Berman, Juan A. Garay

Publication date: 1 April 1993

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

protocoldistributed consensus problemcloture votes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

Agreement in synchronous networks with ubiquitous faults, Stability of long-lived consensus., Distributed CONGEST Algorithms against Mobile Adversaries, The Optimal Strategy for the Average Long-Lived Consensus, The complexity of almost-optimal simultaneous coordination, Average long-lived binary consensus: quantifying the stabilizing role played by memory, Computer science and decision theory, Continuous consensus with ambiguous failures, Continuous Consensus with Ambiguous Failures, Efficient agreement using fault diagnosis., Distributed consensus revisited

Cites Work

• Unnamed Item
• A lower bound for the time to assure interactive consistency
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• Knowledge and common knowledge in a distributed environment
• Early stopping in Byzantine agreement
• Fast Distributed Agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Modular construction of an efficient 1-bit Byzantine agreement protocol
• Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time