On the complexity of global computation in the presence of link failures
From MaRDI portal
Publication:5348840
DOI10.1145/135419.135441zbMath1369.68051OpenAlexW1970913408MaRDI QIDQ5348840
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.135441
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (2)
On the complexity of global computation in the presence of link failures: the general case ⋮ Hundreds of impossibility results for distributed computing
This page was built for publication: On the complexity of global computation in the presence of link failures