A space efficient direct access data structure
From MaRDI portal
Publication:2397148
Recommendations
Cites work
- A simple storage scheme for strings achieving entropy bounds
- Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
- Alphabet partitioning for compressed rank/select and applications
- Evaluation of parallel text alignment systems -- the ARCADE project
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- Jewels of Stringology
- Practical entropy-compressed rank/select dictionary
- Random access to Fibonacci encoded files
- Robust universal complete codes for transmission and compression
- Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
- Universal codeword sets and representations of the integers
Cited in
(8)- Optimal skeleton and reduced Huffman trees
- Accelerated partial decoding in wavelet trees
- Bidirectional adaptive compression
- Random access to Fibonacci encoded files
- Optimal Skeleton Huffman Trees Revisited
- Optimal skeleton Huffman trees
- Forward looking Huffman coding
- Minimizing access pointers into trees and arrays
This page was built for publication: A space efficient direct access data structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397148)