Simone Faro, Thierry Lecroq, Kunsoo Park. Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings. In Jan Holub 0001, Jan Zdárek, editors, Prague Stringology Conference 2020, Prague, Czech Republic, August 31 - September 2, 2020. pages 48-60, Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, 2020. [doi]
@inproceedings{FaroLP20,
title = {Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings},
author = {Simone Faro and Thierry Lecroq and Kunsoo Park},
year = {2020},
url = {http://www.stringology.org/event/2020/p05.html},
researchr = {https://researchr.org/publication/FaroLP20},
cites = {0},
citedby = {0},
pages = {48-60},
booktitle = {Prague Stringology Conference 2020, Prague, Czech Republic, August 31 - September 2, 2020},
editor = {Jan Holub 0001 and Jan Zdárek},
publisher = {Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science},
isbn = {978-80-01-06749-9},
}