{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:42:43Z","timestamp":1765546963838,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002666","name":"Aalto University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002666","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2023,9]]},"abstract":"Abstract<\/jats:title>Consider any locally checkable labeling problem $$\\Pi $$<\/jats:tex-math>\n \u03a0<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in rooted regular trees<\/jats:italic>: there is a finite set of labels $$\\Sigma $$<\/jats:tex-math>\n \u03a3<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and for each label $$x \\in \\Sigma $$<\/jats:tex-math>\n \n x<\/mml:mi>\n \u2208<\/mml:mo>\n \u03a3<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> we specify what are permitted label combinations of the children for an internal node of label x<\/jats:italic> (the leaf nodes are unconstrained). This formalism is expressive enough to capture many classic problems studied in distributed computing, including vertex coloring, edge coloring, and maximal independent set. We show that the distributed computational complexity of any such problem $$\\Pi $$<\/jats:tex-math>\n \u03a0<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> falls in one of the following classes: it is O<\/jats:italic>(1), $$\\Theta (\\log ^* n)$$<\/jats:tex-math>\n \n \u0398<\/mml:mi>\n (<\/mml:mo>\n \n log<\/mml:mo>\n \u2217<\/mml:mo>\n <\/mml:msup>\n n<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, $$\\Theta (\\log n)$$<\/jats:tex-math>\n \n \u0398<\/mml:mi>\n (<\/mml:mo>\n log<\/mml:mo>\n n<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, or $$n^{\\Theta (1)}$$<\/jats:tex-math>\n \n n<\/mml:mi>\n \n \u0398<\/mml:mi>\n (<\/mml:mo>\n 1<\/mml:mn>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:msup>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> rounds in trees with n<\/jats:italic> nodes (and all of these classes are nonempty). We show that the complexity of any given problem is the same in all four standard models of distributed graph algorithms: deterministic $$\\mathsf {LOCAL}$$<\/jats:tex-math>\n LOCAL<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, randomized $$\\mathsf {LOCAL}$$<\/jats:tex-math>\n LOCAL<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, deterministic $$\\mathsf {CONGEST}$$<\/jats:tex-math>\n CONGEST<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and randomized $$\\mathsf {CONGEST}$$<\/jats:tex-math>\n CONGEST<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> model. In particular, we show that randomness does not help in this setting, and the complexity class $$\\Theta (\\log \\log n)$$<\/jats:tex-math>\n \n \u0398<\/mml:mi>\n (<\/mml:mo>\n log<\/mml:mo>\n log<\/mml:mo>\n n<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> does not exist (while it does exist in the broader setting of general trees). We also show how to systematically determine the complexity class of any such problem\u00a0$$\\Pi $$<\/jats:tex-math>\n \u03a0<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, i.e., whether $$\\Pi $$<\/jats:tex-math>\n \u03a0<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> takes O<\/jats:italic>(1), $$\\Theta (\\log ^* n)$$<\/jats:tex-math>\n \n \u0398<\/mml:mi>\n (<\/mml:mo>\n \n log<\/mml:mo>\n \u2217<\/mml:mo>\n <\/mml:msup>\n n<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, $$\\Theta (\\log n)$$<\/jats:tex-math>\n \n \u0398<\/mml:mi>\n (<\/mml:mo>\n log<\/mml:mo>\n n<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, or $$n^{\\Theta (1)}$$<\/jats:tex-math>\n \n n<\/mml:mi>\n \n \u0398<\/mml:mi>\n (<\/mml:mo>\n 1<\/mml:mn>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:msup>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> rounds. While the algorithm may take exponential time in the size of the description of $$\\Pi $$<\/jats:tex-math>\n \u03a0<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, it is nevertheless practical: we provide a freely available implementation of the classifier algorithm, and it is fast enough to classify many problems of interest.<\/jats:p>","DOI":"10.1007\/s00446-022-00435-9","type":"journal-article","created":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T09:44:04Z","timestamp":1661161444000},"page":"277-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Locally checkable problems in rooted trees"],"prefix":"10.1007","volume":"36","author":[{"given":"Alkida","family":"Balliu","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Brandt","sequence":"additional","affiliation":[]},{"given":"Yi-Jun","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Olivetti","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Studen\u00fd","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6117-8089","authenticated-orcid":false,"given":"Jukka","family":"Suomela","sequence":"additional","affiliation":[]},{"given":"Aleksandr","family":"Tereshchenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"key":"435_CR1","doi-asserted-by":"publisher","unstructured":"Balliu, A., Brandt, S., Chang, Y.-J., Olivetti, D., Rabie, M., Suomela, J: The distributed complexity of locally checkable problems on paths is decidable. In: Proc. 38th ACM Symposium on Principles of Distributed Computing (PODC 2019). ACM Press, pp. 262\u2013271. https:\/\/doi.org\/10.1145\/3293611.3331606arxiv: 1811.01672 (2019)","DOI":"10.1145\/3293611.3331606"},{"key":"435_CR2","doi-asserted-by":"publisher","unstructured":"Balliu, A., Brandt, S., Efron, Y., Hirvonen, J., Maus, Y., Olivetti, D., Suomela, J: . Classification of distributed binary labeling problems. In: Proc. 34th International Symposium on Distributed Computing (DISC 2020) (LIPIcs, Vol.\u00a0179). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, 17:1\u201317:17. https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2020.17arxiv: 1911.13294","DOI":"10.4230\/LIPIcs.DISC.2020.17"},{"key":"435_CR3","doi-asserted-by":"publisher","unstructured":"Balliu, A., Brandt, S., Hirvonen, J., Olivetti, D., Rabie, M., Suomela, J: Lower bounds for maximal matchings and maximal independent sets. In: Proc. 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2019). IEEE, pp. 481\u2013497. https:\/\/doi.org\/10.1145\/3461458arxiv: 1901.02441 (2019)","DOI":"10.1145\/3461458"},{"key":"435_CR4","doi-asserted-by":"publisher","unstructured":"Balliu, A., Brandt, S., Olivetti, D., Suomela. J: Almost global problems in the LOCAL model. Distributed Computing. https:\/\/doi.org\/10.1007\/s00446-020-00375-2arxiv: 1805.04776 (2020)","DOI":"10.1007\/s00446-020-00375-2"},{"key":"435_CR5","doi-asserted-by":"publisher","unstructured":"Balliu, A., Brandt, S., Olivetti, D., Suomela, J.: How much does randomness help with locally checkable problems?. In: Proc. 39th ACM Symposium on Principles of Distributed Computing (PODC 2020). ACM Press, pp. 299\u2013308. https:\/\/doi.org\/10.1145\/3382734.3405715arxiv: 1902.06803 (2020)","DOI":"10.1145\/3382734.3405715"},{"key":"435_CR6","doi-asserted-by":"publisher","unstructured":"Balliu, A., Censor-Hillel, K., Yannic Maus, Dennis Olivetti, and Jukka Suomela. 2021. Locally Checkable Labelings with Small Messages. https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2021.8arxiv: 2105.05574","DOI":"10.4230\/LIPIcs.DISC.2021.8"},{"key":"435_CR7","doi-asserted-by":"publisher","unstructured":"Balliu, A., Hirvonen, J., Korhonen, J.\u00a0H., Lempi\u00e4inen, T., Olivetti, D., Suomela. J.: New classes of distributed time complexity. In: Proc. 50th ACM Symposium on Theory of Computing (STOC 2018). ACM Press, PP. 1307\u20131318. https:\/\/doi.org\/10.1145\/3188745.3188860arxiv: 1711.01871 (2018)","DOI":"10.1145\/3188745.3188860"},{"key":"435_CR8","doi-asserted-by":"publisher","unstructured":"Balliu, A., Hirvonen, J., Olivetti, D., Suomela, J.: Hardness of minimal symmetry breaking in distributed computing. In: Proc. 38th ACM Symposium on Principles of Distributed Computing (PODC 2019). ACM Press, pp. 369\u2013378. https:\/\/doi.org\/10.1145\/3293611.3331605arxiv: 1811.01643 (2019)","DOI":"10.1145\/3293611.3331605"},{"key":"435_CR9","doi-asserted-by":"publisher","unstructured":"Barenboim, L., Elkin, M.: Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan & Claypool. https:\/\/doi.org\/10.2200\/S00520ED1V01Y201307DCT011 (2013)","DOI":"10.2200\/S00520ED1V01Y201307DCT011"},{"key":"435_CR10","doi-asserted-by":"publisher","unstructured":"Brandt, S.: An Automatic Speedup Theorem for Distributed Problems. In: Proc. 38th ACM Symposium on Principles of Distributed Computing (PODC 2019). ACM, pp. 379\u2013388. https:\/\/doi.org\/10.2200\/S00520ED1V01Y201307DCT011 (2019)","DOI":"10.2200\/S00520ED1V01Y201307DCT011"},{"key":"435_CR11","doi-asserted-by":"publisher","unstructured":"Brandt, S., Chang, Y.-J., Greb\u00edk, J., Grunau, C., Rozho\u0148, V., Vidny\u00e1nszky, Z.: Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2022.29arXiv:2106.02066 (2021)","DOI":"10.4230\/LIPIcs.ITCS.2022.29"},{"key":"435_CR12","doi-asserted-by":"publisher","unstructured":"Brandt, S., Fischer, O., Hirvonen, J., Keller, B., Lempi\u00e4inen, T., Rybicki, J., Suomela, J., Uitto, J.: A lower bound for the distributed Lov\u00e1sz local lemma. In: Proc. 48th ACM Symposium on Theory of Computing (STOC 2016). ACM Press, pp. 479\u2013488. https:\/\/doi.org\/10.1145\/2897518.2897570arxiv: 1511.00900 (2016)","DOI":"10.1145\/2897518.2897570"},{"key":"435_CR13","doi-asserted-by":"publisher","unstructured":"Brandt, S., Hirvonen, J., Korhonen, J.\u00a0H., Lempi\u00e4inen, T., \u00d6sterg\u00e5rd, P.R.J., Purcell, C., Rybicki, J., Suomela, J., Uzna\u0144ski, P.: LCL problems on grids. In: Proc. 36th ACM Symposium on Principles of Distributed Computing (PODC 2017). ACM Press, pp. 101\u2013110. https:\/\/doi.org\/10.1145\/3087801.3087833arxiv: 1702.05456 (2017)","DOI":"10.1145\/3087801.3087833"},{"key":"435_CR14","doi-asserted-by":"publisher","unstructured":"Chang, Y.-J.: The Complexity Landscape of Distributed Locally Checkable Problems on Trees. In: Proc. 34th International Symposium on Distributed Computing (DISC 2020) (LIPIcs, Vol.\u00a0179). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, pp. 18:1\u201318:17 (2020) https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2020.18","DOI":"10.4230\/LIPIcs.DISC.2020.18"},{"issue":"1","key":"435_CR15","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/17M1117537","volume":"48","author":"Y-J Chang","year":"2019","unstructured":"Chang, Y.-J., Kopelowitz, T., Pettie, S.: An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. SIAM J. Comput. 48(1), 122\u2013143 (2019). https:\/\/doi.org\/10.1137\/17M1117537","journal-title":"SIAM J. Comput."},{"issue":"1","key":"435_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/17M1157957","volume":"48","author":"Y-J Chang","year":"2019","unstructured":"Chang, Y.-J., Pettie, S.: A Time Hierarchy Theorem for the LOCAL Model. SIAM J. Comput. 48(1), 33\u201369 (2019). https:\/\/doi.org\/10.1137\/17M1157957","journal-title":"SIAM J. Comput."},{"key":"435_CR17","doi-asserted-by":"publisher","unstructured":"Chang, Y.-J., Studen\u00fd, J., Suomela, J: Distributed graph problems through an automata-theoretic lens. In: Proc. 28th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2021) (LNCS). Springer. https:\/\/doi.org\/10.1007\/978-3-030-79527-6_3arxiv: 2002.07659 (2021)","DOI":"10.1007\/978-3-030-79527-6_3"},{"issue":"4","key":"435_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00446-016-0287-6","volume":"30","author":"K-M Chung","year":"2017","unstructured":"Chung, K.-M., Pettie, S., Su, H.-H.: Distributed algorithms for the Lov\u00e1sz local lemma and graph coloring. Distributed Comput. 30(4), 261\u2013280 (2017). https:\/\/doi.org\/10.1007\/s00446-016-0287-6","journal-title":"Distributed Comput."},{"issue":"1","key":"435_CR19","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","volume":"70","author":"R Cole","year":"1986","unstructured":"Cole, R., Vishkin, U.: Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking. Inf. Control. 70(1), 32\u201353 (1986). https:\/\/doi.org\/10.1016\/S0019-9958(86)80023-7","journal-title":"Inf. Control."},{"key":"435_CR20","doi-asserted-by":"publisher","unstructured":"Fischer, M, Ghaffari, M.: Sublogarithmic Distributed Algorithms for Lov\u00e1sz Local Lemma, and the Complexity Hierarchy. In: Proc. 31st International Symposium on Distributed Computing (DISC 2017) (LIPIcs, Vol.\u00a091). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, pp. 18:1\u201318:16. (2017) https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2017.18","DOI":"10.4230\/LIPIcs.DISC.2017.18"},{"issue":"1","key":"435_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in Distributed Graph Algorithms. SIAM J. Comput. 21(1), 193\u2013201 (1992). https:\/\/doi.org\/10.1137\/0221015","journal-title":"SIAM J. Comput."},{"key":"435_CR22","doi-asserted-by":"publisher","unstructured":"Miller, G.L., Reif, J.H.: Parallel tree contraction and its application. In: Proc. 26th Annual Symposium on Foundations of Computer Science (FOCS 1985). IEEE, pp. 478\u2013489. https:\/\/doi.org\/10.1109\/SFCS.1985.43 (1985)","DOI":"10.1109\/SFCS.1985.43"},{"key":"435_CR23","doi-asserted-by":"publisher","unstructured":"Naor, M.: A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring. SIAM J. Discret. Math. 4(3), 409\u2013412 (1991). https:\/\/doi.org\/10.1137\/0404036","DOI":"10.1137\/0404036"},{"key":"435_CR24","doi-asserted-by":"publisher","unstructured":"Naor, M., Stockmeyer, L.J.: What Can be Computed Locally? SIAM J. Comput. 24(6), 1259\u20131277 (1995). https:\/\/doi.org\/10.1137\/S0097539793254571","DOI":"10.1137\/S0097539793254571"},{"key":"435_CR25","doi-asserted-by":"crossref","unstructured":"Olivetti, D.: Round Eliminator: a tool for automatic speedup simulation. https:\/\/github.com\/olidennis\/round-eliminator (2020)","DOI":"10.1145\/3382734.3405694"},{"key":"435_CR26","doi-asserted-by":"publisher","unstructured":"Rozho\u0148, V., Ghaffari, M.: Polylogarithmic-time deterministic network decomposition and distributed derandomization. In: Proc. 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020). ACM, pp. 350\u2013363. https:\/\/doi.org\/10.1145\/3357713.3384298 (2020)","DOI":"10.1145\/3357713.3384298"},{"key":"435_CR27","unstructured":"Studen\u00fd J., Tereshchenko, A.: Rooted Tree Classifier. https:\/\/github.com\/jendas1\/rooted-tree-classifier (2021)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-022-00435-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-022-00435-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-022-00435-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T18:03:04Z","timestamp":1690826584000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-022-00435-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,22]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["435"],"URL":"https:\/\/doi.org\/10.1007\/s00446-022-00435-9","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2022,8,22]]},"assertion":[{"value":"15 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}