Pages that link to "Item:Q924538"
From MaRDI portal
The following pages link to Succinct data structures for flexible text retrieval systems (Q924538):
Displaying 19 items.
- Document retrieval with one wildcard (Q287451) (← links)
- Two dimensional range minimum queries and Fibonacci lattices (Q294929) (← links)
- Less space: indexing for queries with wildcards (Q300263) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- Top-\(k\) document retrieval in optimal space (Q396625) (← links)
- Multi-pattern matching with bidirectional indexes (Q396713) (← links)
- Cross-document pattern matching (Q396714) (← links)
- 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)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- Succinct indexes for reporting discriminating and generic words (Q501011) (← 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)
- The range 1 query (R1Q) problem (Q1659997) (← links)
