Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings

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]

Authors

Simone Faro

This author has not been identified. Look up 'Simone Faro' in Google

Thierry Lecroq

This author has not been identified. Look up 'Thierry Lecroq' in Google

Kunsoo Park

This author has not been identified. Look up 'Kunsoo Park' in Google