On-line versus off-line computation in dynamic text compression

DOI10.1016/0020-0190(96)00068-3zbMath0998.94521OpenAlexW2043478690MaRDI QIDQ671415

James A. Storer, Sergio De Agostino

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00068-3

zbMATH Keywords

Computational complexityDynamic text compressionOn-line and off-line computationTextual substitution

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (6)

A worst-case analysis of the LZ2 compression algorithm ⋮ Scalability and communication in parallel low-complexity lossless compression ⋮ Lempel-Ziv data compression on parallel and distributed systems ⋮ Compression in the presence of shared data ⋮ A fully linear-time approximation algorithm for grammar-based compression ⋮ Bridging Lossy and Lossless Compression by Motif Pattern Discovery

Cites Work

• Unnamed Item
• 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: On-line versus off-line computation in dynamic text compression