Pages that link to "Item:Q294952"
From MaRDI portal
The following pages link to Computing minimal and maximal suffixes of a substring (Q294952):
Displaying 4 items.
- Finding the maximum suffix with fewer comparisons (Q635741) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)