BibTeX record conf/cpm/LabibUW19

download as .bib file

@inproceedings{DBLP:conf/cpm/LabibUW19,
  author       = {Karim Labib and
                  Przemyslaw Uznanski and
                  Daniel Wolleb{-}Graf},
  editor       = {Nadia Pisanti and
                  Solon P. Pissis},
  title        = {Hamming Distance Completeness},
  booktitle    = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019,
                  June 18-20, 2019, Pisa, Italy},
  series       = {LIPIcs},
  volume       = {128},
  pages        = {14:1--14:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CPM.2019.14},
  doi          = {10.4230/LIPICS.CPM.2019.14},
  timestamp    = {Tue, 29 Dec 2020 18:38:08 +0100},
  biburl       = {https://dblp.org/rec/conf/cpm/LabibUW19.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.