Early-deciding consensus is expensive

DOI10.1145/2484239.2484269zbMath1323.68043OpenAlexW2044833067MaRDI QIDQ5176104

Christoph Lenzen, Danny Dolev

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.375.9142

zbMATH Keywords

lower boundsByzantine faultscrash faultscubic message complexityearly-stopping

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (4)

Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication ⋮ Fast agreement in networks with Byzantine nodes ⋮ Early stopping for any number of corruptions ⋮ Costly verification in collective decisions

This page was built for publication: Early-deciding consensus is expensive