Tatiana A. Starikovskaya, Hjalte Wedel Vildhøj. Time-Space Trade-Offs for the Longest Common Substring Problem. In Johannes Fischer, Peter Sanders, editors, Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings. Volume 7922 of Lecture Notes in Computer Science, pages 223-234, Springer, 2013. [doi]
@inproceedings{StarikovskayaV13,
title = {Time-Space Trade-Offs for the Longest Common Substring Problem},
author = {Tatiana A. Starikovskaya and Hjalte Wedel Vildhøj},
year = {2013},
doi = {10.1007/978-3-642-38905-4_22},
url = {http://dx.doi.org/10.1007/978-3-642-38905-4_22},
researchr = {https://researchr.org/publication/StarikovskayaV13},
cites = {0},
citedby = {0},
pages = {223-234},
booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings},
editor = {Johannes Fischer and Peter Sanders},
volume = {7922},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-38905-4},
}