On the Message Complexity of Indulgent Consensus

DOI10.1007/978-3-540-75142-7_23MaRDI QIDQ3523214zbMATH OpenOpenAlexFDO

Authors Dariusz R. Kowalski, Rachid Guerraoui, Seth Gilbert

Publication date 2 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://infoscience.epfl.ch/record/109737/files/cons-disc.pdf

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The inherent price of indulgence
• The inherent price of indulgence
• Lower bounds for asynchronous consensus
• Communication-efficient randomized consensus
• Time and Communication Efficient Consensus for Crash Failures

Cited in

(6)

• The inherent price of indulgence
• Consensus on \(p\)-belief communication
• Using asynchrony and zero degradation to speed up indulgent consensus protocols
• The inherent price of indulgence
• Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
• Generating fast indulgent algorithms

This page was built for publication: On the Message Complexity of Indulgent Consensus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523214)