BibTeX record conf/cpm/BonehFM023

download as .bib file

@inproceedings{DBLP:conf/cpm/BonehFM023,
  author       = {Itai Boneh and
                  Dvir Fried and
                  Adrian Miclaus and
                  Alexandru Popa},
  editor       = {Laurent Bulteau and
                  Zsuzsanna Lipt{\'{a}}k},
  title        = {Faster Algorithms for Computing the Hairpin Completion Distance and
                  Minimum Ancestor},
  booktitle    = {34th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2023,
                  June 26-28, 2023, Marne-la-Vall{\'{e}}e, France},
  series       = {LIPIcs},
  volume       = {259},
  pages        = {5:1--5:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.CPM.2023.5},
  doi          = {10.4230/LIPICS.CPM.2023.5},
  timestamp    = {Wed, 21 Jun 2023 17:07:46 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/BonehFM023.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.