@InProceedings{kutten_et_al:LIPIcs.OPODIS.2023.26,
author = {Kutten, Shay and Robinson, Peter and Tan, Ming Ming},
title = {{Tight Bounds on the Message Complexity of Distributed Tree Verification}},
booktitle = {27th International Conference on Principles of Distributed Systems (OPODIS 2023)},
pages = {26:1--26:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-308-9},
ISSN = {1868-8969},
year = {2024},
volume = {286},
editor = {Bessani, Alysson and D\'{e}fago, Xavier and Nakamura, Junya and Wada, Koichi and Yamauchi, Yukiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2023.26},
URN = {urn:nbn:de:0030-drops-195163},
doi = {10.4230/LIPIcs.OPODIS.2023.26},
annote = {Keywords: Distributed Graph Algorithm, Lower Bound}
}