Pages that link to "Item:Q5473096"
From MaRDI portal
The following pages link to A sublinear time string prefix square detection algorithm (Q5473096):
Displaying 6 items.
- Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
- Optimal parallel detection of squares in strings (Q1194333) (← links)
- Squares, cubes, and time-space efficient string searching (Q1894296) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- On<i>n</i>-power prefix languages (Q3506249) (← links)
- Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. (Q5369541) (← links)