Engineering practical Lempel-Ziv tries
From MaRDI portal
Recommendations
Cites work
- A universal algorithm for sequential data compression
- Alphabet-dependent string searching with wexponential search trees
- An analysis of the Karp-Rabin string matching algorithm
- Approximate string matching on Ziv--Lempel compressed text
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Compact Hash Tables Using Bidirectional Linear Probing
- Compression of individual sequences via variable-rate coding
- Compression with the tudocomp framework
- Constructing LZ78 tries and position heaps in linear time for large alphabets
- Conversion from RLBWT to LZ77
- Dynamic index and LZ factorization in compressed space
- Dynamic Path-decomposed Tries
- Dynamic space efficient hashing
- Efficient algorithms for Lempel-Ziv encoding
- Efficient LZ78 factorization of grammar compressed text
- Efficient randomized pattern-matching algorithms
- Efficient Storage and Retrieval by Content and Address of Static Files
- Fully functional static and dynamic succinct trees
- Hopscotch Hashing
- scientific article; zbMATH DE number 2185628 (Why is no real title available?)
- scientific article; zbMATH DE number 6351507 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 6472611 (Why is no real title available?)
- Indexing compressed text
- Lempel-Ziv factorization powered by space efficient suffix trees
- Lempel-Ziv-78 compressed string dictionaries
- Let sleeping files lie: Pattern matching in Z-compressed files.
- Linear probing with 5-wise independence
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- LZ78 compression in low main memory space
- m-Bonsai: a practical compact dynamic trie
- Masking Dilithium. Efficient implementation and side-channel evaluation
- On the \(k\)-independence required by linear probing and minwise independence
- On the Complexity of Finite Sequences
- Ordered hash tables
- Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch tries
- Refining the \(r\)-index
- Regular expression searching on compressed text
- Representing trees of higher degree
- Space-efficient construction of compressed indexes in deterministic linear time
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Squeezing succinct data structures into entropy bounds
- Stronger Lempel-Ziv based compressed text indexing
- Succinct dynamic cardinal trees
Cited in
(5)- Constructing LZ78 tries and position heaps in linear time for large alphabets
- Fast gapped variants for Lempel-Ziv-Welch compression
- scientific article; zbMATH DE number 2185642 (Why is no real title available?)
- LZ78 compression in low main memory space
- Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch tries
This page was built for publication: Engineering practical Lempel-Ziv tries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5102060)
