Pages that link to "Item:Q1383148"
From MaRDI portal
The following pages link to A worst-case analysis of the LZ2 compression algorithm (Q1383148):
Displaying 10 items.
- Quasi-distinct parsing and optimal compression methods (Q417983) (← links)
- Scalability and communication in parallel low-complexity lossless compression (Q626896) (← links)
- Worst-case analysis of the iterated longest fragment algorithm (Q1603464) (← links)
- Lempel-Ziv data compression on parallel and distributed systems (Q1736484) (← links)
- The fractional greedy algorithm for data compression (Q1906680) (← links)
- On the bit-complexity of Lempel-Ziv compression (Q2862201) (← links)
- Relations between greedy and bit-optimal LZ77 encodings (Q3304145) (← links)
- Compression algorithm of text files based on LZSS (Q3407010) (← links)
- (Q5283997) (← links)
- Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing (Q6184325) (← links)