Consensus in the presence of timing uncertainty
From MaRDI portal
Publication:5255814
DOI10.1145/112600.112612zbMath1314.68071MaRDI QIDQ5255814
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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W15: Distributed algorithms
Related Items
The Theta-Model: achieving synchrony without clocks, Structured Derivation of Semi-Synchronous Algorithms