Engineering Practical Lempel-Ziv Tries
From MaRDI portal
Publication:5102060
DOI10.1145/3481638zbMath1499.68098OpenAlexW3208341227MaRDI QIDQ5102060
Diego Arroyuelo, Rodrigo Cánovas, Dominik Köppl, Johannes Fischer, Marvin Löbel, Rajeev Raman, Gonzalo Navarro
Publication date: 6 September 2022
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3481638
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Succinct dynamic cardinal trees
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Lempel-Ziv-78 compressed string dictionaries
- Lempel-Ziv factorization powered by space efficient suffix trees
- Representing trees of higher degree
- An analysis of the Karp-Rabin string matching algorithm
- Let sleeping files lie: Pattern matching in Z-compressed files.
- Regular expression searching on compressed text
- Approximate string matching on Ziv--Lempel compressed text
- Masking Dilithium. Efficient implementation and side-channel evaluation
- Dynamic index and LZ factorization in compressed space
- Refining the \(r\)-index
- Constructing LZ78 tries and position heaps in linear time for large alphabets
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Stronger Lempel-Ziv based compressed text indexing
- Fully Functional Static and Dynamic Succinct Trees
- Alphabet-Dependent String Searching with Wexponential Search Trees
- Linear Probing with 5-wise Independence
- Compact Hash Tables Using Bidirectional Linear Probing
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Hopscotch Hashing
- Indexing compressed text
- Squeezing succinct data structures into entropy bounds
- Efficient randomized pattern-matching algorithms
- On the Complexity of Finite Sequences
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Efficient Storage and Retrieval by Content and Address of Static Files
- Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
- Ordered hash tables
- Efficient LZ78 Factorization of Grammar Compressed Text
- On the k -Independence Required by Linear Probing and Minwise Independence
- Efficient algorithms for Lempel-Ziv encoding
- Dynamic Space Efficient Hashing.
- LZ78 Compression in Low Main Memory Space
- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries
- m-Bonsai: A Practical Compact Dynamic Trie
- Dynamic Path-decomposed Tries
This page was built for publication: Engineering Practical Lempel-Ziv Tries
