Published in: LIPIcs, Volume 397, 40th International Symposium on Distributed Computing (DISC 2026)
Chiara Piombi. Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties. In 40th International Symposium on Distributed Computing (DISC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 397, pp. 28:1-28:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{piombi:LIPIcs.DISC.2026.28,
author = {Piombi, Chiara},
title = {{Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties}},
booktitle = {40th International Symposium on Distributed Computing (DISC 2026)},
pages = {28:1--28:21},
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.28},
URN = {urn:nbn:de:0030-drops-281343},
doi = {10.4230/LIPIcs.DISC.2026.28},
annote = {Keywords: Distributed graph algorithms, LOCAL model, locally checkable labeling problems, Presburger monadic second-order logic, rooted trees, complexity gaps}
}