Pages that link to "Item:Q1796824"
From MaRDI portal
The following pages link to Near-optimal computation of runs over general alphabet via non-crossing LCE queries (Q1796824):
Displaying 6 items.
- Computing the maximum exponent in a stream (Q2118207) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Cartesian and Lyndon trees (Q2285120) (← links)
- Computing runs on a trie (Q5088914) (← links)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921) (← links)
- Searching runs in streams (Q6536256) (← links)