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

DOI10.1016/0020-0190(96)00068-3MaRDI QIDQ671415zbMATH OpenOpenAlexFDO

Authors Sergio De Agostino, James A. Storer

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)

Cites work

• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• On encoding and decoding with two-way head machines
• On the Complexity of Finite Sequences

Cited in

(6)

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

This page was built for publication: On-line versus off-line computation in dynamic text compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671415)