OCD

DOI10.1145/1400751.1400803zbMath1301.68067OpenAlexW2077652130MaRDI QIDQ2934363

Danny Dolev, Ezra N. Hoch

Publication date: 12 December 2014

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

Full work available at URL: https://doi.org/10.1145/1400751.1400803

zbMATH Keywords

fault tolerancedistributed computingself-stabilizationByzantine failureslong-lived consensusrepetitive consensus

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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)

The Optimal Strategy for the Average Long-Lived Consensus ⋮ Average long-lived binary consensus: quantifying the stabilizing role played by memory ⋮ Stability in geodesics for memoryless binary long-lived consensus ⋮ Geodesic stability for memoryless binary long-lived consensus

This page was built for publication: OCD