LZ78 compression in low main memory space
From MaRDI portal
Recommendations
Cites work
- A universal algorithm for sequential data compression
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Compression of individual sequences via variable-rate coding
- Indexing compressed text
- Lempel Ziv computation in small space (LZ-CISS)
- Linear probing with 5-wise independence
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- m-Bonsai: a practical compact dynamic trie
- On the \(k\)-independence required by linear probing and minwise independence
- 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
(8)- Space-Conscious Compression
- Compression with the tudocomp framework
- scientific article; zbMATH DE number 2087041 (Why is no real title available?)
- Bidirectional Text Compression in External Memory
- Engineering practical Lempel-Ziv tries
- On two LZ78-style grammars: compression bounds and compressed-space computation
- Dynamic Path-decomposed Tries
- Lempel-Ziv-78 compressed string dictionaries
This page was built for publication: LZ78 compression in low main memory space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5150917)