Counting distinct square substrings in sublinear time
From MaRDI portal
Cites work
- A note on the maximum number of k-powers in a finite word
- Algorithms on Strings, Trees and Sequences
- 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
- Computing all distinct squares in linear time for integer alphabets
- Efficient Enumeration of Distinct Factors Using Package Representations
- Efficient on-line repetition detection
- Efficient parallel algorithms to test square-freeness and factorize strings
- Extracting powers and periods in a word from its runs structure
- Faster approximate pattern matching: a unified approach
- Finding maximal repetitions in a word in linear time
- How many squares can a string contain?
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 7651115 (Why is no real title available?)
- scientific article; zbMATH DE number 7740885 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Internal pattern matching queries in a text and applications
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Linear time runs over general ordered alphabets
- Longest palindromic substring in sublinear time
- Lyndon arrays in sublinear time
- Minimal suffix and rotation of a substring in optimal time
- On the maximum number of cubic subwords in a word
- On the Number of Distinct Squares in Finite Sequences: Some Old and New Results
- On the number of squares in a finite word
- Online detection of repetitions with backtracking
- Optimal construction of compressed indexes for highly repetitive texts
- Optimal parallel detection of squares in strings
- Optimal square detection over general alphabets
- Repetition Detection in a Dynamic String
- Simple and flexible detection of contiguous repeats using a suffix tree
- Squares, cubes, and time-space efficient string searching
- String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
- Sublinear time Lempel-Ziv (LZ77) factorization
- The ``runs theorem
- Towards optimal packed string matching
- Transducers and repetitions
- Über unendliche Zeichenreihen.
- Uniqueness Theorems for Periodic Functions
This page was built for publication: Counting distinct square substrings in sublinear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310200)
