BibTeX record conf/cpm/BreslauerCT93

download as .bib file

@inproceedings{DBLP:conf/cpm/BreslauerCT93,
  author       = {Dany Breslauer and
                  Livio Colussi and
                  Laura Toniolo},
  editor       = {Alberto Apostolico and
                  Maxime Crochemore and
                  Zvi Galil and
                  Udi Manber},
  title        = {Tight Comparison Bounds for the String Prefix-Matching Problem},
  booktitle    = {Combinatorial Pattern Matching, 4th Annual Symposium, {CPM} 93, Padova,
                  Italy, June 2-4, 1993, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {684},
  pages        = {11--19},
  publisher    = {Springer},
  year         = {1993},
  url          = {https://doi.org/10.1007/BFb0029793},
  doi          = {10.1007/BFB0029793},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/BreslauerCT93.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.