Pages that link to "Item:Q496538"
From MaRDI portal
The following pages link to New simple efficient algorithms computing powers and runs in strings (Q496538):
Displaying 6 items.
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- On primary and secondary repetitions in words (Q764340) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Locating maximal approximate runs in a string (Q2410363) (← links)
