On the bit-complexity of Lempel-Ziv compression

Paolo Ferragina, Igor Nitto, Rossano Venturini. On the bit-complexity of Lempel-Ziv compression. In Claire Mathieu, editor, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009. pages 768-777, SIAM, 2009. [doi]

@inproceedings{FerraginaNV09,
  title = {On the bit-complexity of Lempel-Ziv compression},
  author = {Paolo Ferragina and Igor Nitto and Rossano Venturini},
  year = {2009},
  doi = {10.1145/1496770.1496854},
  url = {http://doi.acm.org/10.1145/1496770.1496854},
  researchr = {https://researchr.org/publication/FerraginaNV09},
  cites = {0},
  citedby = {0},
  pages = {768-777},
  booktitle = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009},
  editor = {Claire Mathieu},
  publisher = {SIAM},
}