BibTeX record conf/esa/AbboudFGSS23

• > Home > conf/esa/AbboudFGSS23

@inproceedings{DBLP:conf/esa/AbboudFGSS23,
  author       = {Amir Abboud and
                  Nick Fischer and
                  Elazar Goldenberg and
                  {Karthik {C. S.}} and
                  Ron Safier},
  editor       = {Inge Li G{\o}rtz and
                  Martin Farach{-}Colton and
                  Simon J. Puglisi and
                  Grzegorz Herman},
  title        = {Can You Solve Closest String Faster Than Exhaustive Search?},
  booktitle    = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
                  4-6, 2023, Amsterdam, The Netherlands},
  series       = {LIPIcs},
  volume       = {274},
  pages        = {3:1--3:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2023.3},
  doi          = {10.4230/LIPICS.ESA.2023.3},
  timestamp    = {Wed, 30 Aug 2023 17:07:25 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/AbboudFGSS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}