The following pages link to (Q5417613):
Displaying 44 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Less space: indexing for queries with wildcards (Q300263) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Top-\(k\) document retrieval in optimal space (Q396625) (← links)
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Linear-space data structures for range minority query in arrays (Q494786) (← links)
- Succinct indexes for reporting discriminating and generic words (Q501011) (← links)
- A grouping approach for succinct dynamic dictionary matching (Q513298) (← links)
- Combined data structure for previous- and next-smaller-values (Q533896) (← links)
- Succinct representation of dynamic trees (Q541673) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- Encoding 2D range maximum queries (Q897899) (← links)
- Space-efficient indexes for forbidden extension queries (Q1632508) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- High-order entropy compressed bit vectors with rank/select (Q1736624) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- Ranked document retrieval for multiple patterns (Q1784746) (← links)
- New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Practical space-efficient index for structural pattern matching (Q2169971) (← links)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- A uniform paradigm to succinctly encode various families of trees (Q2441590) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Fast Compressed Tries through Path Decompositions (Q2828185) (← links)
- General Document Retrieval in Compact Space (Q2828189) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- (Q5088898) (← links)
- Fast matching statistics in small space (Q5140728) (← links)
- The Heaviest Induced Ancestors Problem Revisited (Q5140784) (← links)
- Spaces, Trees, and Colors (Q5176183) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
