An efficient online algorithm for square detection

DOI10.1007/978-3-540-27798-9_46MaRDI QIDQ4681205zbMATH OpenOpenAlexFDO

Authors Zeshan Peng, Hofung Leung, Hing-Fung Ting

Publication date 15 June 2005

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

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

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

Cited in

(9)

• Online detection of repetitions with backtracking
• ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS
• scientific article; zbMATH DE number 3913712 (Why is no real title available?)
• 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 optimal algorithm for online square detection
• A fast algorithm for finding the positions of all squares in a run-length encoded string
• An efficient algorithm for online square detection

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

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