Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492886zbMATH OpenOpenAlexFDO

Authors Jesper Jansson, Zeshan Peng

Publication date 20 October 2006

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

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

Mathematics Subject Classification ID

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

Recommendations

• ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 3913712
• An efficient algorithm for online square detection
• Computing and Combinatorics

Cited in

(7)

• 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?)
• Computing and Combinatorics
• New simple efficient algorithms computing powers and runs in strings
• Combinatorial Pattern Matching
• An efficient algorithm for online square detection

This page was built for publication: Mathematical Foundations of Computer Science 2005

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