Pages that link to "Item:Q5140774"
From MaRDI portal
The following pages link to Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. (Q5140774):
Displaying 5 items.
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Longest property-preserved common factor: a new string-processing framework (Q2297866) (← links)
- Repetition Detection in a Dynamic String (Q5075738) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)