A universal upper bound on the performance of the Lempel-Ziv algorithm on maliciously-constructed data

James I. Lathrop, Martin Strauss 0001. A universal upper bound on the performance of the Lempel-Ziv algorithm on maliciously-constructed data. In Bruno Carpentieri, Alfredo De Santis, Ugo Vaccaro, James A. Storer, editors, Compression and Complexity of SEQUENCES 1997, Positano, Amalfitan Coast, Salerno, Italy, June 11-13, 1997, Proceedings. pages 123-135, IEEE, 1997. [doi]

Abstract

Abstract is missing.