%0 Conference Paper %1 conf/wdag/Balliu0KOS23 %A Balliu, Alkida %A Brandt, Sebastian %A Kuhn, Fabian %A Olivetti, Dennis %A Schmid, Gustav %B DISC %D 2023 %E Oshman, Rotem %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 7:1-7:21 %T On the Node-Averaged Complexity of Locally Checkable Problems on Trees. %U http://dblp.uni-trier.de/db/conf/wdag/disc2023.html#Balliu0KOS23 %V 281 %@ 978-3-95977-301-0

@inproceedings{conf/wdag/Balliu0KOS23, added-at = {2023-11-12T00:00:00.000+0100}, author = {Balliu, Alkida and Brandt, Sebastian and Kuhn, Fabian and Olivetti, Dennis and Schmid, Gustav}, biburl = {https://www.bibsonomy.org/bibtex/21d79e24be961c17132380b97b75730bc/dblp}, booktitle = {DISC}, crossref = {conf/wdag/2023}, editor = {Oshman, Rotem}, ee = {https://doi.org/10.4230/LIPIcs.DISC.2023.7}, interhash = {444e5197be910fdfa8b61218e1759352}, intrahash = {1d79e24be961c17132380b97b75730bc}, isbn = {978-3-95977-301-0}, keywords = {dblp}, pages = {7:1-7:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-04-09T17:02:14.000+0200}, title = {On the Node-Averaged Complexity of Locally Checkable Problems on Trees.}, url = {http://dblp.uni-trier.de/db/conf/wdag/disc2023.html#Balliu0KOS23}, volume = 281, year = 2023 }