From a static impossibility to an adaptive lower bound

DOI10.1145/1060590.1060696zbMath1192.68846OpenAlexW2122491152MaRDI QIDQ3581411

Bastian Pochon, Eli Gafni, Rachid Guerraoui

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (5)

Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures ⋮ Narrowing Power vs. Efficiency in Synchronous Set Agreement ⋮ A topological treatment of early-deciding set-agreement ⋮ The Complexity of Early Deciding Set Agreement: How can Topology help? ⋮ Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound

This page was built for publication: From a static impossibility to an adaptive lower bound