The following pages link to Range LCP (Q5920340):
Displaying 8 items.
- Computing minimal and maximal suffixes of a substring (Q294952) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Range Minimum Query Indexes in Higher Dimensions (Q2942253) (← links)
- A linear-space data structure for range-LCP queries in poly-logarithmic time (Q5918832) (← links)
- Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)
- Range shortest unique substring queries (Q6536259) (← links)
- Internal pattern matching queries in a text and applications (Q6621750) (← links)