A worst-case analysis of the LZ2 compression algorithm

DOI10.1006/inco.1997.2668zbMath0895.68027OpenAlexW2041248510MaRDI QIDQ1383148

Sergio De Agostino, Riccardo Silvestri

Publication date: 8 September 1998

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1997.2668

zbMATH Keywords

de Bruijn sequencesparsing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (3)

Scalability and communication in parallel low-complexity lossless compression ⋮ Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing ⋮ Lempel-Ziv data compression on parallel and distributed systems

Cites Work

• Unnamed Item
• On-line versus off-line computation in dynamic text compression
• On encoding and decoding with two-way head machines
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding

This page was built for publication: A worst-case analysis of the LZ2 compression algorithm