{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T04:06:25Z","timestamp":1749873985033,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101162747"],"award-info":[{"award-number":["101162747"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733565","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"66-76","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Optimal Deterministic LOCAL Algorithms on Trees"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5393-6636","authenticated-orcid":false,"given":"Sebastian","family":"Brandt","sequence":"first","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6137-4025","authenticated-orcid":false,"given":"Ananth","family":"Narayanan","sequence":"additional","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3461458"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467901"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520027"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538440"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1381770"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405710"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2979675"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00446-009-0088-2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Leonid Barenboim and Michael Elkin. 2013. Distributed graph coloring: Fundamentals and recent developments. (2013).","DOI":"10.1007\/978-3-031-02009-4"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/12088848X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331611"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897570"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"Sebastian Brandt and Ananth Narayanan. 2025. Towards Optimal Deterministic LOCAL Algorithms on Trees. arXiv. Full version of this paper. 10.48550\/arXiv.2505.01410","DOI":"10.48550\/arXiv.2505.01410"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405745"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3365004"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1117537"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch168"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0344-4"},{"key":"e_1_3_2_1_19_1","volume-title":"Local conflict coloring. In 2016 IEEE 57th annual symposium on foundations of computer science (FOCS)","author":"Fraigniaud Pierre","unstructured":"Pierre Fraigniaud, Marc Heinrich, and Adrian Kosowski. 2016. Local conflict coloring. In 2016 IEEE 57th annual symposium on foundations of computer science (FOCS). IEEE, 625\u2013634."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585243"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00007"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch97"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.173"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00101"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055471"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.166"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28429"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.76"},{"key":"e_1_3_2_1_29_1","volume-title":"International Colloquium on Structural Information and Communication Complexity","author":"Kuhn Fabian","unstructured":"Fabian Kuhn, Yannic Maus, and Simon Weidner. 2018. Deterministic distributed ruling sets of line graphs. In International Colloquium on Structural Information and Communication Complexity. Springer, 193\u2013208."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146387"},{"key":"e_1_3_2_1_31_1","volume-title":"International Colloquium on Structural Information and Communication Complexity","author":"Lievonen Henrik","unstructured":"Henrik Lievonen, Timoth\u00e9 Picavet, and Jukka Suomela. 2024. Distributed Binary Labeling Problems in High-Degree Graphs. In International Colloquium on Structural Information and Communication Complexity. Springer, 402\u2013419."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.20"},{"key":"e_1_3_2_1_33_1","series-title":"SIAM Journal on computing 21, 1","volume-title":"Locality in distributed graph algorithms","author":"Linial Nathan","year":"1992","unstructured":"Nathan Linial. 1992. Locality in distributed graph algorithms. SIAM Journal on computing 21, 1 (1992), 193\u2013201."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2020.16"},{"key":"e_1_3_2_1_35_1","first-page":"478","article-title":"Parallel tree contraction and its application","volume":"26","author":"Miller Gary L","year":"1985","unstructured":"Gary L Miller and John H Reif. 1985. Parallel tree contraction and its application. In FOCS, Vol. 26. 478\u2013489.","journal-title":"FOCS"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793254571"},{"key":"e_1_3_2_1_37_1","volume-title":"Some simple distributed algorithms for sparse networks. Distributed computing 14, 2","author":"Panconesi Alessandro","year":"2001","unstructured":"Alessandro Panconesi and Romeo Rizzi. 2001. Some simple distributed algorithms for sparse networks. Distributed computing 14, 2 (2001), 97\u2013100."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384298"}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:24:02Z","timestamp":1749824642000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":39,"alternative-id":["10.1145\/3732772.3733565","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733565","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}