BibTeX record conf/wdag/Balliu0KOS23

download as .bib file

@inproceedings{DBLP:conf/wdag/Balliu0KOS23,
  author       = {Alkida Balliu and
                  Sebastian Brandt and
                  Fabian Kuhn and
                  Dennis Olivetti and
                  Gustav Schmid},
  editor       = {Rotem Oshman},
  title        = {On the Node-Averaged Complexity of Locally Checkable Problems on Trees},
  booktitle    = {37th International Symposium on Distributed Computing, {DISC} 2023,
                  October 10-12, 2023, L'Aquila, Italy},
  series       = {LIPIcs},
  volume       = {281},
  pages        = {7:1--7:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.DISC.2023.7},
  doi          = {10.4230/LIPICS.DISC.2023.7},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/Balliu0KOS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.