BibTeX record conf/sosa/CasaresPPST24

download as .bib file

@inproceedings{DBLP:conf/sosa/CasaresPPST24,
  author       = {Antonio Casares and
                  Marcin Pilipczuk and
                  Michal Pilipczuk and
                  U{\'{e}}verton S. Souza and
                  K. S. Thejaswini},
  editor       = {Merav Parter and
                  Seth Pettie},
  title        = {Simple and tight complexity lower bounds for solving Rabin games},
  booktitle    = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
                  VA, USA, January 8-10, 2024},
  pages        = {160--167},
  publisher    = {{SIAM}},
  year         = {2024},
  url          = {https://doi.org/10.1137/1.9781611977936.16},
  doi          = {10.1137/1.9781611977936.16},
  timestamp    = {Wed, 10 Apr 2024 20:26:09 +0200},
  biburl       = {https://dblp.org/rec/conf/sosa/CasaresPPST24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.