Lower bounds for the number of repetitions in 2D strings
From MaRDI portal
Publication:2146138
DOI10.1007/978-3-030-86692-1_15OpenAlexW3201840946MaRDI QIDQ2146138FDOQ2146138
Authors: Samah Ghazawi, Gad M. Landau, Paweł Gawrychowski 
Publication date: 15 June 2022
Full work available at URL: https://arxiv.org/abs/2105.14903
Recommendations
Cites Work
- Episturmian words and some constructions of de Luca and Rauzy
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- Squares, cubes, and time-space efficient string searching
- Extracting powers and periods in a word from its runs structure
- How many squares can a string contain?
- 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
- The maximum number of squares in a tree
- How many double squares can a string contain?
- The ``runs theorem
- Two-Dimensional Periodicity in Rectangular Arrays
- Title not available (Why is that?)
- The ``runs conjecture
- Not So Many Runs in Strings
- Maximal repetitions in strings
- How many runs can a string contain?
- Palindromes in circular words
- AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
- The number of runs in a string
- Title not available (Why is that?)
- Universal reconstruction of a string
- String powers in trees
- Two-dimensional maximal repetitions
- Prefix frequency of lost positions
- Square-density increasing mappings
- Distinct squares in circular words
- Optimal parallel two dimensional text searching on a CREW PRAM
- Fibonacci arrays and their two-dimensional repetitions
- Two-dimensional maximal repetitions
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Lower bounds for the number of repetitions in 2D strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146138)
