Fast compressed tries through path decompositions
From MaRDI portal
Recommendations
- Fast Compressed Tries through Path Decompositions
- Fast algorithm for optimal compression of graphs
- Dynamic Path-decomposed Tries
- On the Expected Performance of Path Compression Algorithms
- Compressing optimal paths with run length encoding
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Top Tree Compression of Tries.
- Top tree compression of tries
Cites work
- A data structure for dynamic trees
- Cache-oblivious string dictionaries
- Compact dictionaries for variable-length keys and data with applications
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressing and indexing labeled trees, with applications
- Efficient Storage and Retrieval by Content and Address of Static Files
- Extended compact web graph representations
- Fully-functional succinct trees
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 7051248 (Why is no real title available?)
- Practical entropy-compressed rank/select dictionary
- Representing trees of higher degree
- Succinct representation of balanced parentheses and static trees
- Succinct representations of binary trees for range minimum queries
- Succinct Trees in Practice
- The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Genera
- The string B-tree
- Theory and practice of monotone minimal perfect hashing
- Ultra-succinct representation of ordered trees with applications
- Universal codeword sets and representations of the integers
Cited in
(16)- PTrie: data structure for compressing and storing sets via prefix sharing
- Top tree compression of tries
- Faster compressed quadtrees
- c-trie++: a dynamic trie tailored for fast prefix searches
- On the correctness of a lock-free compression-based elastic mechanism for a hash trie design
- Random access to high-order entropy compressed text
- Practical implementation of space-efficient dynamic keyword dictionaries
- Fast Compressed Tries through Path Decompositions
- m-Bonsai: a practical compact dynamic trie
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
- Top Tree Compression of Tries.
- Dynamic Path-decomposed Tries
- Compressed string dictionaries via data-aware subtrie compaction
- NP-completeness on the length of double-arrays and the sparse matrix problem with at least logarithmic alphabets/widths
- Lempel-Ziv-78 compressed string dictionaries
- A simple representation of tree covering utilizing balanced parentheses and efficient implementation of average-case optimal RMQs
This page was built for publication: Fast compressed tries through path decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828185)
