Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
From MaRDI portal
Publication:4031319
DOI10.1007/BF01187072zbMATH Open0766.68004WikidataQ57635745 ScholiaQ57635745MaRDI QIDQ4031319FDOQ4031319
Authors: Piotr Berman, Juan Garay 
Publication date: 1 April 1993
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Recommendations
Cites Work
- Early stopping in Byzantine agreement
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Knowledge and common knowledge in a distributed environment
- A lower bound for the time to assure interactive consistency
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- Fast Distributed Agreement
- Title not available (Why is that?)
- Modular construction of an efficient 1-bit Byzantine agreement protocol
- Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
Cited In (13)
- Agreement in synchronous networks with ubiquitous faults
- Average long-lived binary consensus: quantifying the stabilizing role played by memory
- Stability of long-lived consensus.
- The complexity of almost-optimal simultaneous coordination
- Continuous consensus with ambiguous failures
- The optimal strategy for the average long-lived consensus
- Continuous Consensus with Ambiguous Failures
- Fast agreement in networks with Byzantine nodes
- Distributed consensus revisited
- Distributed CONGEST Algorithms against Mobile Adversaries
- Early stopping for any number of corruptions
- Efficient agreement using fault diagnosis.
- Computer science and decision theory
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)
