Pages that link to "Item:Q3060784"
From MaRDI portal
The following pages link to Alphabet Partitioning for Compressed Rank/Select and Applications (Q3060784):
Displaying 20 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- Random access to Fibonacci encoded files (Q313776) (← links)
- Compact binary relation representations with rich functionality (Q386006) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Top-\(k\) document retrieval in optimal space (Q396625) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
- Distribution-aware compressed full-text indexes (Q2017875) (← links)
- Optimal skeleton and reduced Huffman trees (Q2220839) (← links)
- Accelerated partial decoding in wavelet trees (Q2295619) (← links)
- Engineering a lightweight external memory suffix array construction algorithm (Q2363989) (← links)
- A space efficient direct access data structure (Q2397148) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Succinct encoding of binary strings representing triangulations (Q2665909) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- General Document Retrieval in Compact Space (Q2828189) (← links)
- Compressed Data Structures for Dynamic Sequences (Q3452849) (← links)
- Optimal Skeleton Huffman Trees (Q5150936) (← links)
