Pages that link to "Item:Q396644"

The following pages link to A computational framework for determining run-maximal strings (Q396644):

Displaying 7 items.

• A computational substantiation of the \(d\)-step approach to the number of distinct squares problem (Q313771) (← links)
• On the structure of run-maximal strings (Q414413) (← links)
• On the maximal sum of exponents of runs in a string (Q450542) (← 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)
• On the Maximal Sum of Exponents of Runsin a String (Q3000489) (← links)
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound (Q5449797) (← links)