Pages that link to "Item:Q924538"
From MaRDI portal
The following pages link to Succinct data structures for flexible text retrieval systems (Q924538):
Displaying 48 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)
- Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) (← 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)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- A simple algorithm for computing the document array (Q2011038) (← links)
- New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
- Range majorities and minorities in arrays (Q2032347) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- Bottom-\(k\) document retrieval (Q2343302) (← links)
- On succinct representations of binary trees (Q2363992) (← links)
- Faster index for property matching (Q2380078) (← links)
- Improved range minimum queries (Q2397152) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- General Document Retrieval in Compact Space (Q2828189) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Indexes for Document Retrieval with Relevance (Q2848984) (← links)
- Range Minimum Query Indexes in Higher Dimensions (Q2942253) (← links)
- Compact Indexes for Flexible Top-$$k$$ Retrieval (Q2942258) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- Counting Colours in Compressed Strings (Q3011854) (← links)
- Efficient Seeds Computation Revisited (Q3011867) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max (Q3448818) (← links)
- (Q5091119) (← links)
- Spaces, Trees, and Colors (Q5176183) (← links)
- (Q5743458) (← links)
