On the Message Complexity of Indulgent Consensus

DOI10.1007/978-3-540-75142-7_23zbMath1145.68355OpenAlexW2156508286MaRDI QIDQ3523214

Dariusz R. Kowalski, Rachid Guerraoui

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

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

Related Items (1)

Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication

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