Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
From MaRDI portal
Publication:6169968
DOI10.1142/S0129054122440075OpenAlexW4309728841MaRDI QIDQ6169968FDOQ6169968
Authors: Julian Pape-Lange 
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054122440075
Cites Work
- Uniformly growing k-th power-free homomorphisms
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Uniqueness Theorems for Periodic Functions
- Extracting powers and periods in a word from its runs structure
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Dejean's conjecture holds for \(n\geq 30\)
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- A proof of Dejean’s conjecture
- Dejean's conjecture holds for N ≥ 27
- Last cases of Dejean's conjecture
- Dejean's conjecture and Sturmian words
- On maximal repetitions of arbitrary exponent
- Efficiently finding all maximal \(\alpha\)-gapped repeats
- At the roots of dictionary compression: string attractors
- Two-dimensional maximal repetitions
- Prefix frequency of lost positions
- Optimal bounds for computing \(\alpha\)-gapped repeats
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings
Cited In (3)
This page was built for publication: Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169968)
