Local problems in trees across a wide range of distributed models
Loading...
Access rights
openAccess
CC BY
CC BY
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Date
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
17
Series
28th International Conference on Principles of Distributed Systems (OPODIS 2024), pp. 1-17, Leibniz International Proceedings in Informatics (LIPIcs) ; Volume 324
Abstract
The randomized online-LOCAL model captures a number of models of computing; it is at least as strong as all of these models: - the classical LOCAL model of distributed graph algorithms, - the quantum version of the LOCAL model, - finitely dependent distributions [e.g. Holroyd 2016], - any model that does not violate physical causality [Gavoille, Kosowski, Markiewicz, DISC 2009], - the SLOCAL model [Ghaffari, Kuhn, Maus, STOC 2017], and - the dynamic-LOCAL and online-LOCAL models [Akbari et al., ICALP 2023]. In general, the online-LOCAL model can be much stronger than the LOCAL model. For example, there are locally checkable labeling problems (LCLs) that can be solved with logarithmic locality in the online-LOCAL model but that require polynomial locality in the LOCAL model. However, in this work we show that in trees, many classes of LCL problems have the same locality in deterministic LOCAL and randomized online-LOCAL (and as a corollary across all the above-mentioned models). In particular, these classes of problems do not admit any distributed quantum advantage. We present a near-complete classification for the case of rooted regular trees. We also fully classify the super-logarithmic region in unrooted regular trees. Finally, we show that in general trees (rooted or unrooted, possibly irregular, possibly with input labels) problems that are global in deterministic LOCAL remain global also in the randomized online-LOCAL model.Description
Other note
Citation
Dhar, A, Kujawa, E, Lievonen, H, Modanese, A, Müftüoglu, M, Studený, J & Suomela, J 2025, Local problems in trees across a wide range of distributed models. in S Bonomi, L Galletta, E Rivière & V Schiavoni (eds), 28th International Conference on Principles of Distributed Systems (OPODIS 2024)., 27, Leibniz International Proceedings in Informatics (LIPIcs), vol. 324, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 1-17, International Conference on Principles of Distributed Systems, Lucca, Italy, 11/12/2024. https://doi.org/10.4230/LIPIcs.OPODIS.2024.27