Why extension-based proofs fail

DOI10.1145/3313276.3316407zbMath1433.68052arXiv1811.01421OpenAlexW2963106249MaRDI QIDQ5212839

Leqi Zhu, Faith Ellen, Rati Gelashvili, Dan Alistarh, James Aspnes

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.01421

zbMATH Keywords

combinatorial topologyset agreementimpossibility proofsvalency arguments

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)

Related Items (4)

Why Extension-Based Proofs Fail ⋮ Wait-free approximate agreement on graphs ⋮ A topological perspective on distributed network algorithms ⋮ Wait-free approximate agreement on graphs

This page was built for publication: Why extension-based proofs fail