Pages that link to "Item:Q903195"
From MaRDI portal
The following pages link to Computing runs on a general alphabet (Q903195):
Displaying 11 items.
- Finding the leftmost critical factorization on unordered alphabet (Q290524) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- On the size of the smallest alphabet for Lyndon trees (Q2326391) (← links)
- Tight lower bounds for the longest common extension problem (Q2628282) (← links)
- Computing runs on a trie (Q5088914) (← links)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921) (← links)
- Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Searching runs in streams (Q6536256) (← links)
