# Dynamic Longest Common Substring in Polylogarithmic Time

> Research article (DROPS (Schloss Dagstuhl – Leibniz Center for Informatics), 2020) · cited 18× · AI/ML

**Wikidata**: [openalex:W3037236243](https://www.wikidata.org/wiki/openalex:W3037236243)  
**Source**: https://4ort.xyz/entity/dynamic-longest-common-substring-in-polylogarithmic-time