A bivalency proof of the lower bound for uniform consensus
type: Item
instance of: scholarly article
title: A bivalency proof of the lower bound for uniform consensus
zbMATH Open document ID: 1184.68110
author: Xianbing Wang
author: Yong Meng Teo
author: Jiannong Cao
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 5650150
zbMATH Keywords: uniform consensus
zbMATH Keywords: bivalency argument
zbMATH Keywords: synchronous distributed systems
zbMATH Keywords: distributed computing
Wikidata QID: Q60250343
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.08.002
OpenAlex ID: W2024491172
cites work: A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
cites work: Uniform consensus is harder than consensus
cites work: Early stopping in Byzantine agreement
cites work: Impossibility of distributed consensus with one faulty process
cites work: Unifying synchronous and asynchronous message-passing models
cites work: A simple proof of the uniform consensus synchronous lower bound.
cites work: Q3126969
cites work: A layered analysis of consensus
DOI: 10.1016/J.IPL.2005.08.002
Recommended article: A simple proof of the uniform consensus synchronous lower bound.
Recommended article: Consensus-halving via theorems of Borsuk-Ulam and Tucker
Recommended article: Lower bounds for randomized consensus under a weak adversary
Recommended article: Lower Bounds for Randomized Consensus under a Weak Adversary
Recommended article: Q4413396
Recommended article: Lower bounds for asynchronous consensus
Recommended article: Q4527023
Recommended article: Distributed Computing
Recommended article: Cutoff bounds for consensus algorithms
description: scientific article; zbMATH DE number 5650150