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]
@inproceedings{LathropS97,
title = {A universal upper bound on the performance of the Lempel-Ziv algorithm on maliciously-constructed data},
author = {James I. Lathrop and Martin Strauss 0001},
year = {1997},
doi = {10.1109/SEQUEN.1997.666909},
url = {https://doi.org/10.1109/SEQUEN.1997.666909},
researchr = {https://researchr.org/publication/LathropS97},
cites = {0},
citedby = {0},
pages = {123-135},
booktitle = {Compression and Complexity of SEQUENCES 1997, Positano, Amalfitan Coast, Salerno, Italy, June 11-13, 1997, Proceedings},
editor = {Bruno Carpentieri and Alfredo De Santis and Ugo Vaccaro and James A. Storer},
publisher = {IEEE},
isbn = {0-8186-8133-0},
}