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]
@inproceedings{AmirCPR19,
title = {Longest Common Substring Made Fully Dynamic},
author = {Amihood Amir and Panagiotis Charalampopoulos and Solon P. Pissis and Jakub Radoszewski},
year = {2019},
doi = {10.4230/LIPIcs.ESA.2019.6},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.6},
researchr = {https://researchr.org/publication/AmirCPR19},
cites = {0},
citedby = {0},
booktitle = {27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany},
editor = {Michael A. Bender and Ola Svensson and Grzegorz Herman},
volume = {144},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-124-5},
}