Locally Checkable Problems in Rooted Trees

Alkida Balliu, Sebastian Brandt 0002, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko. Locally Checkable Problems in Rooted Trees. In Avery Miller, Keren Censor Hillel, Janne H. Korhonen, editors, PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021. pages 263-272, ACM, 2021. [doi]

@inproceedings{Balliu0OSST21,
  title = {Locally Checkable Problems in Rooted Trees},
  author = {Alkida Balliu and Sebastian Brandt 0002 and Dennis Olivetti and Jan Studený and Jukka Suomela and Aleksandr Tereshchenko},
  year = {2021},
  doi = {10.1145/3465084.3467934},
  url = {https://doi.org/10.1145/3465084.3467934},
  researchr = {https://researchr.org/publication/Balliu0OSST21},
  cites = {0},
  citedby = {0},
  pages = {263-272},
  booktitle = {PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021},
  editor = {Avery Miller and Keren Censor Hillel and Janne H. Korhonen},
  publisher = {ACM},
  isbn = {978-1-4503-8548-0},
}