Alphabet partitioning for compressed rank/select and applications
From MaRDI portal
Publication:3060784
Recommendations
Cited in
(22)- On compressing permutations and adaptive sorting
- Top-\(k\) document retrieval in optimal space
- Space-efficient substring occurrence estimation
- Optimal skeleton Huffman trees
- Colored range queries and document retrieval
- Optimal skeleton and reduced Huffman trees
- Compressed Data Structures for Dynamic Sequences
- A space efficient direct access data structure
- Engineering a lightweight external memory suffix array construction algorithm
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Compact representation of graphs of small clique-width
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Random access to Fibonacci encoded files
- Practical entropy-compressed rank/select dictionary
- Compact binary relation representations with rich functionality
- Succinct encoding of binary strings representing triangulations
- Distribution-aware compressed full-text indexes
- General document retrieval in compact space
- Compact representation of graphs with bounded bandwidth or treedepth
- Accelerated partial decoding in wavelet trees
- Wavelet trees for all
- A practical alphabet-partitioning rank/select data structure
This page was built for publication: Alphabet partitioning for compressed rank/select and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060784)