Longest Common Substring Made Fully Dynamic

Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski. Longest Common Substring Made Fully Dynamic. In Michael A. Bender, Ola Svensson, Grzegorz Herman, editors, 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany. Volume 144 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

Abstract

Abstract is missing.