The inherent price of indulgence
type: Item
instance of: scholarly article
title: The inherent price of indulgence
zbMATH Open document ID: 1264.68085
author: Partha Sharathi Dutta
author: Rachid Guerraoui
published in: Distributed Computing
publication date: 2013-06-07T00:00:00Z
full work available at URL: IC TECH REPORT 200231.pdf
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6172092
zbMATH Keywords: fault tolerance
zbMATH Keywords: distributed algorithms
zbMATH Keywords: consensus time complexity
MaRDI profile type: Publication
OpenAlex ID: W2707263665
cites work: A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
cites work: Unreliable failure detectors for reliable distributed systems
cites work: Uniform consensus is harder than consensus
cites work: Distributed Computing
cites work: Impossibility of distributed consensus with one faulty process
cites work: Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
cites work: Indulgent algorithms (preliminary version)
cites work: A simple proof of the uniform consensus synchronous lower bound.
cites work: The Byzantine Generals Problem
cites work: Q3126969
DOI: 10.1007/S00446-005-0124-9
description: scientific article; zbMATH DE number 6172092