Pages that link to "Item:Q476914"
From MaRDI portal
The following pages link to A simple yet time-optimal and linear-space algorithm for shortest unique substring queries (Q476914):
Displaying 4 items.
- Computing minimal unique substrings for a sliding window (Q2118202) (← links)
- Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510) (← links)
- In-place algorithms for exact and approximate shortest unique substring problems (Q2399613) (← links)
- Compact data structures for shortest unique substring queries (Q6536247) (← links)