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

DOI10.1007/BF01187072MaRDI QIDQ4031319zbMATH OpenWikidataFDO

Authors Piotr Berman, Juan 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)

Recommendations

• Fast and simple distributed consensus
• Communication-efficient randomized consensus
• scientific article; zbMATH DE number 1830912
• Asynchronous byzantine agreement protocols
• Consensus algorithms with one-bit messages

Cites work

• scientific article; zbMATH DE number 4121395 (Why is no real title available?)
• A lower bound for the time to assure interactive consistency
• Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
• Early stopping in Byzantine agreement
• Fast Distributed Agreement
• Knowledge and common knowledge in a distributed environment
• Modular construction of an efficient 1-bit Byzantine agreement protocol
• Reaching Agreement in the Presence of Faults
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• The Byzantine Generals Problem

Cited in

(13)

• Continuous Consensus with Ambiguous Failures
• Efficient agreement using fault diagnosis.
• Continuous consensus with ambiguous failures
• Computer science and decision theory
• Distributed CONGEST Algorithms against Mobile Adversaries
• Agreement in synchronous networks with ubiquitous faults
• Distributed consensus revisited
• Early stopping for any number of corruptions
• The optimal strategy for the average long-lived consensus
• Stability of long-lived consensus.
• Average long-lived binary consensus: quantifying the stabilizing role played by memory
• Fast agreement in networks with Byzantine nodes
• The complexity of almost-optimal simultaneous coordination

This page was built for publication: Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031319)