tight bounds for k-set agreement with limited-scope failure detectors
From MaRDI portal
Publication:2943758
DOI10.1145/872035.872067zbMath1321.68282OpenAlexW2077426357MaRDI QIDQ2943758
Lucia Draque Penso, Maurice P. Herlihy
Publication date: 4 September 2015
Published in: Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/872035.872067
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)
Cites Work
This page was built for publication: tight bounds for k-set agreement with limited-scope failure detectors