A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
From MaRDI portal
Publication:1606983
DOI10.1016/S0020-0190(99)00100-3zbMath0999.68018OpenAlexW2569772192MaRDI QIDQ1606983
Marcos Kawazoe Aguilera, Sam Toueg
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00100-3
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (17)
Functions on the real line with nonnegative Fourier transforms ⋮ Synchronous condition-based consensus ⋮ Agreement in synchronous networks with ubiquitous faults ⋮ Performance study of Byzantine agreement protocol with artificial neural network ⋮ Synchronous \(t\)-resilient consensus in arbitrary graphs ⋮ Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures ⋮ Message and time efficient consensus protocols for synchronous distributed systems ⋮ The inherent price of indulgence ⋮ Hundreds of impossibility results for distributed computing ⋮ Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures ⋮ Bounded cost algorithms for multivalued consensus using binary consensus instances ⋮ Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links ⋮ Narrowing Power vs. Efficiency in Synchronous Set Agreement ⋮ Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound ⋮ A bivalency proof of the lower bound for uniform consensus ⋮ Back to the Coordinated Attack Problem ⋮ A simple proof of the uniform consensus synchronous lower bound.
This page was built for publication: A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
