Optimal bounds for distinct quartics
From MaRDI portal
Cites work
- A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
- A decomposition theorem for partially ordered sets
- A Generalization of the Suffix Tree to Square Matrices, with Applications
- A note on the number of squares in a word
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
- Algorithms on Strings
- Algorithms on Strings, Trees and Sequences
- Alphabet-Independent Two-Dimensional Witness Computation
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- An efficient algorithm for online square detection
- 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
- Asymptotic behavior of the numbers of runs and microruns
- Computing all distinct squares in linear time for integer alphabets
- Data structures and algorithms for the string statistics problem
- Dynamic and approximate pattern matching in 2D
- Dynamic suffix tree and two-dimensional texts management
- Efficient 2-dimensional approximate matching of half-rectangular figures
- Efficient on-line repetition detection
- Efficient parallel algorithms to test square-freeness and factorize strings
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Extracting powers and periods in a word from its runs structure
- Fast algorithm for partial covers in words
- Fast Pattern Matching in Strings
- Faster two dimensional scaled matching
- Fibonacci arrays and their two-dimensional repetitions
- How many double squares can a string contain?
- How many runs can a string contain?
- How many squares can a string contain?
- scientific article; zbMATH DE number 3900666 (Why is no real title available?)
- scientific article; zbMATH DE number 2086666 (Why is no real title available?)
- Inplace 2D matching in compressed images
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Linear time construction of cover suffix tree and applications
- Lower bounds for the number of repetitions in 2D strings
- Maximal repetitions in strings
- Multiple matching of rectangular patterns
- Not So Many Runs in Strings
- On linear-time alphabet-independent 2-dimensional pattern matching
- On the construction of classes of suffix trees for square matrices: Algorithms and applications
- On the Number of Distinct Squares in Finite Sequences: Some Old and New Results
- Online detection of repetitions with backtracking
- Optimal discovery of repetitions in 2D
- Optimal off-line detection of repetitions in a string
- Optimal parallel detection of squares in strings
- Optimal parallel two dimensional text searching on a CREW PRAM
- Optimal square detection over general alphabets
- Optimal Two-Dimensional Compressed Matching
- Real two dimensional scaled matching
- Squares, cubes, and time-space efficient string searching
- Succinct 2D dictionary matching
- The ``runs conjecture
- The ``runs theorem
- The number of repetitions in 2D-strings
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
- The origins of combinatorics on words
- Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time
- Two-dimensional dictionary matching
- Two-dimensional maximal repetitions
- Two-dimensional pattern matching in linear time and small space
- Two-Dimensional Periodicity in Rectangular Arrays
- Uniqueness Theorems for Periodic Functions
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Über unendliche Zeichenreihen.
This page was built for publication: Optimal bounds for distinct quartics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875165)
