The possibility and the complexity of achieving fault-tolerant coordination
From MaRDI portal
Publication:5348852
DOI10.1145/135419.135460zbMath1370.68032OpenAlexW2067769666MaRDI QIDQ5348852
Publication date: 21 August 2017
Published in: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/135419.135460
Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (2)
The complexity of almost-optimal simultaneous coordination ⋮ Using knowledge to optimally achieve coordination in distributed systems
This page was built for publication: The possibility and the complexity of achieving fault-tolerant coordination
