Pages that link to "Item:Q496539"

The following pages link to A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539):

Displaying 14 items.

• A computational substantiation of the \(d\)-step approach to the number of distinct squares problem (Q313771) (← links)
• A computational framework for determining run-maximal strings (Q396644) (← links)
• On the maximal sum of exponents of runs in a string (Q450542) (← 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)
• Distinct squares in run-length encoded strings (Q606988) (← links)
• Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
• On the Maximal Sum of Exponents of Runsin a String (Q3000489) (← links)
• A d-Step Approach for Distinct Squares in Strings (Q3011845) (← links)
• The number of q-ary words with restrictions on the length of the maximal run (Q4522783) (← links)
• Constructing Words with High Distinct Square Densities (Q5016360) (← links)
• The “Runs” Theorem (Q5359492) (← links)
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound (Q5449797) (← links)