Pages that link to "Item:Q2862201"
From MaRDI portal
The following pages link to On the bit-complexity of Lempel-Ziv compression (Q2862201):
Displaying 17 items.
- The greedy approach to dictionary-based static text compression on a distributed system (Q491153) (← links)
- Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable (Q538463) (← links)
- A worst-case analysis of the LZ2 compression algorithm (Q1383148) (← links)
- Comparison of LZ77-type parsings (Q1621503) (← links)
- Lempel-Ziv-like parsing in small space (Q2205632) (← links)
- Fast gapped variants for Lempel-Ziv-Welch compression (Q2373875) (← links)
- Dictionary-Symbolwise Flexible Parsing (Q3000525) (← links)
- Relations between greedy and bit-optimal LZ77 encodings (Q3304145) (← links)
- A note on the Ziv - Lempel model for compressing individual sequences (Corresp.) (Q3968880) (← links)
- Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression (Q3991389) (← links)
- Bidirectional Text Compression in External Memory (Q5075783) (← links)
- Lempel-Ziv Compression in a Sliding Window (Q5110879) (← links)
- Bicriteria Data Compression (Q5242925) (← links)
- (Q5283997) (← links)
- Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing (Q6184325) (← links)
- Sublinear time Lempel-Ziv (LZ77) factorization (Q6545423) (← links)
- New advances in rightmost Lempel-Ziv (Q6545424) (← links)