Pages that link to "Item:Q396644"
From MaRDI portal
The following pages link to A computational framework for determining run-maximal strings (Q396644):
Displaying 3 items.
- A computational substantiation of the \(d\)-step approach to the number of distinct squares problem (Q313771) (← links)
- A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539) (← links)
- Bannai et al. method proves the \(d\)-step conjecture for strings (Q516879) (← links)
