@InProceedings{amir_et_al:LIPIcs.ESA.2019.6,
author = {Amir, Amihood and Charalampopoulos, Panagiotis and Pissis, Solon P. and Radoszewski, Jakub},
title = {{Longest Common Substring Made Fully Dynamic}},
booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)},
pages = {6:1--6:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-124-5},
ISSN = {1868-8969},
year = {2019},
volume = {144},
editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.6},
URN = {urn:nbn:de:0030-drops-111275},
doi = {10.4230/LIPIcs.ESA.2019.6},
annote = {Keywords: longest common substring, string algorithms, dynamic algorithms}
}