A bivalency proof of the lower bound for uniform consensus

DOI10.1016/j.ipl.2005.08.002zbMath1184.68110OpenAlexW2024491172WikidataQ60250343 ScholiaQ60250343MaRDI QIDQ1044730

Yong Meng Teo, Jiannong Cao, Xianbing Wang

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.08.002

zbMATH Keywords

distributed computingsynchronous distributed systemsuniform consensusbivalency argument

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (3)

Unbeatable consensus ⋮ Message and time efficient consensus protocols for synchronous distributed systems ⋮ Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound

Cites Work

• Unnamed Item
• A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
• A simple proof of the uniform consensus synchronous lower bound.
• A Layered Analysis of Consensus
• Unifying synchronous and asynchronous message-passing models
• Early stopping in Byzantine agreement
• Impossibility of distributed consensus with one faulty process
• Uniform consensus is harder than consensus

This page was built for publication: A bivalency proof of the lower bound for uniform consensus