scientific article; zbMATH DE number 3913712
From MaRDI portal
Publication:3690246
Recommendations
Cited in
(37)- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Optimal parallel detection of squares in strings
- On two-dimensional pattern matching by optimal parallel algorithms
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Transducers and repetitions
- Detecting leftmost maximal periodicities
- Two-pattern strings. I: A recognition algorithm
- Detecting morphic images of a word: On the rank of a pattern
- Optimal bounds for computing \({\alpha}\)-gapped repeats
- Approximate periodicity
- Finding the leftmost critical factorization on unordered alphabet
- Online detection of repetitions with backtracking
- On prefix/suffix-square free words
- scientific article; zbMATH DE number 3864532 (Why is no real title available?)
- ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS
- scientific article; zbMATH DE number 3972211 (Why is no real title available?)
- Un réseau linéaire pour la reconnaissance des mots sans carré
- Efficient string matching on packed texts
- Detecting the morphic images of a word : improving the general algorithm
- An efficient algorithm to test square-freeness of strings compressed by straight-line programs
- Computing and Combinatorics
- New simple efficient algorithms computing powers and runs in strings
- Computing all distinct squares in linear time for integer alphabets
- Computing longest common square subsequences
- Optimal parallel algorithms for periods, palindromes and squares (extended abstract)
- Factorizing a String into Squares in Linear Time
- An efficient algorithm to test square-freeness of strings compressed by balanced straight line programs
- A sublinear time string prefix square detection algorithm
- Mathematical Foundations of Computer Science 2005
- Combinatorial Pattern Matching
- Simple and flexible detection of contiguous repeats using a suffix tree
- The lexicographically least square-free word with a given prefix
- Efficient detection of quasiperiodicities in strings
- A fast algorithm for finding the positions of all squares in a run-length encoded string
- An efficient algorithm for online square detection
- Computing runs on a general alphabet
- Efficient on-line repetition detection
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3690246)
