An optimal algorithm for online square detection

DOI10.1007/11496656_24MaRDI QIDQ5713550zbMATH OpenOpenAlexFDO

Authors Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu

Publication date 14 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b137128

Mathematics Subject Classification ID

Combinatorics on words (68R15) Nonnumerical algorithms (68W05)

Recommendations

• An efficient algorithm for online square detection
• An efficient online algorithm for square detection
• ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS
• Mathematical Foundations of Computer Science 2005
• scientific article; zbMATH DE number 3913712

Cited in

(7)

• ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS
• scientific article; zbMATH DE number 3913712 (Why is no real title available?)
• An efficient online algorithm for square detection
• New simple efficient algorithms computing powers and runs in strings
• A sublinear time string prefix square detection algorithm
• Mathematical Foundations of Computer Science 2005
• An efficient algorithm for online square detection

This page was built for publication: An optimal algorithm for online square detection

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