Published in: LIPIcs, Volume 397, 40th International Symposium on Distributed Computing (DISC 2026)
Joel Rybicki and Yaroslav Verbitsky. Solvability of Approximate Agreement on Graphs and Simplicial Complexes. In 40th International Symposium on Distributed Computing (DISC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 397, pp. 7:1-7:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{rybicki_et_al:LIPIcs.DISC.2026.7,
author = {Rybicki, Joel and Verbitsky, Yaroslav},
title = {{Solvability of Approximate Agreement on Graphs and Simplicial Complexes}},
booktitle = {40th International Symposium on Distributed Computing (DISC 2026)},
pages = {7:1--7:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-454-3},
ISSN = {1868-8969},
year = {2026},
volume = {397},
editor = {Moses Jr., William K. and Censor-Hillel, Keren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2026.7},
URN = {urn:nbn:de:0030-drops-281138},
doi = {10.4230/LIPIcs.DISC.2026.7},
annote = {Keywords: approximate agreement, impossibility results, algebraic topology}
}