Pages that link to "Item:Q2211363"
From MaRDI portal
The following pages link to Dynamic and internal longest common substring (Q2211363):
Displaying 7 items.
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Shortest unique palindromic substring queries in semi-dynamic settings (Q2169977) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
- Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)
- Data structures for computing unique palindromes in static and non-static strings (Q6119834) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)