The following pages link to (Q4828998):
Displaying 50 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Document retrieval with one wildcard (Q287451) (← links)
- Reporting consecutive substring occurrences under bounded gap constraints (Q294948) (← links)
- Indexing and querying color sets of images (Q306719) (← links)
- Compact binary relation representations with rich functionality (Q386006) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Top-\(k\) document retrieval in optimal space (Q396625) (← links)
- Cross-document pattern matching (Q396714) (← links)
- A new efficient indexing algorithm for one-dimensional real scaled patterns (Q414881) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- Efficient index for retrieving top-\(k\) most frequent documents (Q616994) (← links)
- Cache oblivious algorithms for the RMQ and the RMSQ problems (Q626901) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Fast set intersection and two-patterns matching (Q708235) (← links)
- Tree path majority data structures (Q784481) (← links)
- Succinct data structures for flexible text retrieval systems (Q924538) (← links)
- Text indexing with errors (Q925060) (← links)
- Property matching and weighted matching (Q932325) (← links)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- Approximate colored range and point enclosure queries (Q1018093) (← links)
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines (Q1041794) (← links)
- Space-efficient indexes for forbidden extension queries (Q1632508) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Ranked document retrieval for multiple patterns (Q1784746) (← 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)
- Internal dictionary matching (Q2037109) (← links)
- Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
- Indexing weighted sequences: neat and efficient (Q2288210) (← links)
- Ranked document selection (Q2297857) (← links)
- On hardness of several string indexing problems (Q2342674) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- Top-\(k\) term-proximity in succinct space (Q2362352) (← links)
- On succinct representations of binary trees (Q2363992) (← links)
- Indexing factors with gaps (Q2391183) (← links)
- Algorithms to compute the Burrows-Wheeler similarity distribution (Q2420649) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
- Languages with mismatches (Q2456367) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
- I/O-optimal categorical 3-sided skyline queries (Q2664953) (← links)
- General Document Retrieval in Compact Space (Q2828189) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Array Range Queries (Q2848983) (← links)
- Indexes for Document Retrieval with Relevance (Q2848984) (← links)
- Ranked Document Retrieval with Forbidden Pattern (Q2942247) (← links)
- Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints (Q2942274) (← links)
