@InProceedings{balliu_et_al:LIPIcs.DISC.2023.7,
author = {Balliu, Alkida and Brandt, Sebastian and Kuhn, Fabian and Olivetti, Dennis and Schmid, Gustav},
title = {{On the Node-Averaged Complexity of Locally Checkable Problems on Trees}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {7:1--7:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.7},
URN = {urn:nbn:de:0030-drops-191330},
doi = {10.4230/LIPIcs.DISC.2023.7},
annote = {Keywords: distributed graph algorithms, locally checkable labelings, node-averaged complexity, trees}
}