Pages that link to "Item:Q1268630"
From MaRDI portal
The following pages link to How many squares can a string contain? (Q1268630):
Displaying 50 items.
- A computational substantiation of the \(d\)-step approach to the number of distinct squares problem (Q313771) (← links)
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- The three-squares lemma for partial words with one hole (Q418740) (← links)
- How many double squares can a string contain? (Q476303) (← links)
- On a lemma of Crochemore and Rytter (Q491147) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← 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)
- Distinct squares in run-length encoded strings (Q606988) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- On the number of frames in binary words (Q719267) (← links)
- Characterization of dense patterns having distinct squares (Q831749) (← links)
- Clusters of repetition roots: single chains (Q831839) (← links)
- Maximal repetitions in strings (Q931723) (← links)
- Optimality of some algorithms to detect quasiperiodicities (Q986546) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- The exact number of squares in Fibonacci words (Q1292484) (← links)
- String powers in trees (Q1679231) (← links)
- Partial words with a unique position starting a square (Q1730024) (← links)
- On the maximum number of cubic subwords in a word (Q1761496) (← links)
- Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295) (← links)
- Repetitions in Toeplitz words and the Thue threshold (Q2106611) (← links)
- Clusters of repetition roots forming prefix chains (Q2112177) (← links)
- On closed-rich words (Q2117106) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← links)
- Bi-immunity over different size alphabets (Q2243580) (← links)
- Square network on a word (Q2243587) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- A note on the number of squares in a word (Q2373759) (← links)
- On the average number of regularities in a word (Q2437740) (← links)
- Squares in partial words (Q2440165) (← links)
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares (Q2568974) (← links)
- On the number of \(k\)-powers in a finite word (Q2672960) (← links)
- ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS (Q2909197) (← links)
- String Powers in Trees (Q2942264) (← links)
- A d-Step Approach for Distinct Squares in Strings (Q3011845) (← links)
- A NEW PROOF OF THE THREE-SQUARES LEMMA FOR PARTIAL WORDS WITH ONE HOLE (Q3069745) (← links)
- Words with the Maximum Number of Abelian Squares (Q3449363) (← links)
- Square-Density Increasing Mappings (Q3449366) (← links)
- Palindromic Complexity of Trees (Q3451098) (← links)
- A note on the number of squares in a partial word with one hole (Q3653094) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)
- Distinct Squares in Circular Words (Q5150916) (← links)
- On the number of squares in partial words (Q5190081) (← links)
- (Q5874500) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
- Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
