An efficient algorithm for online square detection
From MaRDI portal
Recommendations
Cites work
- A strongly primitive word of arbitrary length and its application †
- Algorithms on Strings, Trees and Sequences
- An infinite square-free co-CFL
- An O(n log n) algorithm for finding all repetitions in a string
- An Optimal O(\log \log N)-Time Parallel Algorithm for Detecting all Squares in a String
- An optimal algorithm for computing the repetitions in a word
- Applications of an infinite square-free co-CFL
- Classification of noncounting events
- Efficient parallel algorithms to test square-freeness and factorize strings
- scientific article; zbMATH DE number 3913712 (Why is no real title available?)
- scientific article; zbMATH DE number 3976360 (Why is no real title available?)
- scientific article; zbMATH DE number 3770980 (Why is no real title available?)
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Optimal off-line detection of repetitions in a string
- Optimal parallel detection of squares in strings
- Simple and flexible detection of contiguous repeats using a suffix tree
- Transducers and repetitions
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
Cited in
(9)- ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS
- scientific article; zbMATH DE number 3913712 (Why is no real title available?)
- Computing and Combinatorics
- A sublinear time string prefix square detection algorithm
- Mathematical Foundations of Computer Science 2005
- Combinatorial Pattern Matching
- Optimal bounds for distinct quartics
- A fast algorithm for finding the positions of all squares in a run-length encoded string
- Efficient on-line repetition detection
This page was built for publication: An efficient algorithm for online square detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860815)
