Pages that link to "Item:Q1757839"
From MaRDI portal
The following pages link to The maximal number of cubic runs in a word (Q1757839):
Displaying 10 items.
- On the density of Lyndon roots in factors (Q507403) (← links)
- Efficiently computing runs on a trie (Q820550) (← links)
- Clusters of repetition roots: single chains (Q831839) (← links)
- Clusters of repetition roots forming prefix chains (Q2112177) (← links)
- Cartesian and Lyndon trees (Q2285120) (← links)
- Some results on the number of periodic factors in words (Q2288207) (← links)
- Linear construction of a left Lyndon tree (Q2672265) (← links)
- (Q5088889) (← links)
- Computing runs on a trie (Q5088914) (← links)
- The “Runs” Theorem (Q5359492) (← links)
