BibTeX record conf/cpm/StarikovskayaV13

download as .bib file

@inproceedings{DBLP:conf/cpm/StarikovskayaV13,
  author       = {Tatiana Starikovskaya and
                  Hjalte Wedel Vildh{\o}j},
  editor       = {Johannes Fischer and
                  Peter Sanders},
  title        = {Time-Space Trade-Offs for the Longest Common Substring Problem},
  booktitle    = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013,
                  Bad Herrenalb, Germany, June 17-19, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7922},
  pages        = {223--234},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-38905-4\_22},
  doi          = {10.1007/978-3-642-38905-4\_22},
  timestamp    = {Tue, 15 Oct 2019 16:50:31 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/StarikovskayaV13.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.