Pages that link to "Item:Q2807851"
From MaRDI portal
The following pages link to Subquadratic-Time Algorithms for Abelian Stringology Problems (Q2807851):
Displayed 4 items.
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- String covers of a tree (Q2146126) (← links)
- String Periods in the Order-Preserving Model (Q3304137) (← links)