The following pages link to The “Runs” Theorem (Q5359492):
Displayed 9 items.
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
- Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
- Lyndon partial words and arrays with applications (Q6111445) (← links)
- String rearrangement inequalities and a total order between primitive words (Q6111479) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
- Finite and infinite closed-rich words (Q6140350) (← links)
- Maximal closed substrings (Q6166967) (← links)