Pages that link to "Item:Q924538"
From MaRDI portal
The following pages link to Succinct data structures for flexible text retrieval systems (Q924538):
Displayed 12 items.
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Improved algorithms for the range next value problem and applications (Q428870) (← links)
- Cache oblivious algorithms for the RMQ and the RMSQ problems (Q626901) (← links)
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- Errata for ``Faster index for property matching'' (Q989567) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Faster index for property matching (Q2380078) (← links)
- Counting Colours in Compressed Strings (Q3011854) (← links)
- Efficient Seeds Computation Revisited (Q3011867) (← links)