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

Information Processing Letters

Volumn 59, Issue 3, 1996, Pages 169-174

  De Agostino, Sergio ^a   Storer, James A ^a  

^a BRANDEIS UNIVERSITY   (United States)

Author keywords

Computational complexity; Dynamic text compression; On line and off line computation; Textual substitution

Indexed keywords

EID: 0001288468     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00068-3     Document Type: Article

References (8)

1. A. Lempel and J. Ziv, On the complexity of finite sequences, IEEE Trans. Information Theory 22 (1976) 75-81.
2. A. Lempel and J. Ziv, A universal algorithm for sequential data compression, IEEE Trans. Information Theory 23 (1977) 337-343.
3. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computation (Plenum Press, New York, 1972) 85-103.
4. V.S. Miller and M.N. Wegman, Variations on theme by Ziv-Lempel, in: A. Apostolico and Z. Galil, eds., Combinatorial Algorithms on Words (Springer, Berlin, 1985) 131-140.
5. D. Sheinwald, A. Lempel and J. Ziv, On encoding and decoding with two-way head machines, Inform. and Comput. 116 (1995) 128-133.
6. J.A. Storer, Data Compression: Methods and Theory (Computer Science Press, Rockville, MD, 1988).
7. T.A. Welch, A technique for high-performance data compression, IEEE Comput. 17 (1984) 8-19.
8. J. Ziv and A. Lempel, Compression of individual sequences via variable rate coding, IEEE Trans. Information Theory 24 (1978) 530-536.