Optimal square detection over general alphabets

DOI10.1137/1.9781611977554.CH189MaRDI QIDQ6538720zbMATH OpenFDO

Authors Jonas Ellert, Paweł Gawrychowski, Garance Gourdel

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH189

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• Optimal bounds for distinct quartics
• Searching 2D-strings for matching frames
• Quasi-linear-time algorithm for a longest common circular factor
• String 2-covers with no length restrictions
• Minimal generators in optimal time
• Counting distinct square substrings in sublinear time

This page was built for publication: Optimal square detection over general alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538720)