BibTeX record conf/mfcs/ColcombetJ22

download as .bib file

@inproceedings{DBLP:conf/mfcs/ColcombetJ22,
  author       = {Thomas Colcombet and
                  Arthur Jaquard},
  editor       = {Stefan Szeider and
                  Robert Ganian and
                  Alexandra Silva},
  title        = {A Complexity Approach to Tree Algebras: the Polynomial Case},
  booktitle    = {47th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
  series       = {LIPIcs},
  volume       = {241},
  pages        = {37:1--37:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2022.37},
  doi          = {10.4230/LIPICS.MFCS.2022.37},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/ColcombetJ22.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.