Pages that link to "Item:Q496539"
From MaRDI portal
The following pages link to A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539):
Displaying 8 items.
- A computational substantiation of the \(d\)-step approach to the number of distinct squares problem (Q313771) (← links)
- How many double squares can a string contain? (Q476303) (← links)
- On the density of Lyndon roots in factors (Q507403) (← links)
- Bannai et al. method proves the \(d\)-step conjecture for strings (Q516879) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- A d-Step Approach for Distinct Squares in Strings (Q3011845) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)
- The “Runs” Theorem (Q5359492) (← links)
