A worst-case analysis of the LZ2 compression algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 51878 (Why is no real title available?)
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- On encoding and decoding with two-way head machines
- On the Complexity of Finite Sequences
- On-line versus off-line computation in dynamic text compression
Cited in
(17)- Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
- Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
- A normal sequence compressed by PPM* but not by Lempel-Ziv 78
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- Compression algorithm of text files based on LZSS
- Quasi-distinct parsing and optimal compression methods
- Relations between greedy and bit-optimal LZ77 encodings
- On the approximation ratio of Lempel-Ziv parsing
- On the bit-complexity of Lempel-Ziv compression
- Worst-case analysis of the iterated longest fragment algorithm
- On the bit-complexity of Lempel-Ziv compression
- On the Hardness of Finding Optimal Multiple Preset Dictionaries
- Lempel-Ziv data compression on parallel and distributed systems
- scientific article; zbMATH DE number 764405 (Why is no real title available?)
- scientific article; zbMATH DE number 975330 (Why is no real title available?)
- The fractional greedy algorithm for data compression
- Scalability and communication in parallel low-complexity lossless compression
This page was built for publication: A worst-case analysis of the LZ2 compression algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383148)
