Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMATH Open1156.68613OpenAlexW2494705596MaRDI QIDQ5492886FDOQ5492886

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

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

Mathematics Subject Classification ID

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

Cited In (7)

• New simple efficient algorithms computing powers and runs in strings
• ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS
• An efficient algorithm for online square detection
• Title not available (Why is that?)
• Combinatorial Pattern Matching
• Computing and Combinatorics
• Online detection of repetitions with backtracking

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)