Consensus in the presence of timing uncertainty

DOI10.1145/112600.112612zbMath1314.68071OpenAlexW2050951955MaRDI QIDQ5255814

Stephen J. Ponzio

Publication date: 19 June 2015

Published in: Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) 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 (2)

The Theta-Model: achieving synchrony without clocks ⋮ Structured Derivation of Semi-Synchronous Algorithms

This page was built for publication: Consensus in the presence of timing uncertainty