Mayordomo, Elvira and Moser, Philippe
Polylog space compression is incomparable with
Lempel-Ziv and pushdown compression.
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science.
Springer verlag, Berlin, pp. 633-644.
This paper considers online compression algorithms that use
at most polylogarithmic space (plogon). These algorithms correspond
to compressors in the data stream model. We study the performance
attained by these algorithms and show they are incomparable with both
pushdown compressors and the Lempel-Ziv compression algorithm.
||© ACM, 2009. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009) doi>10.1007/978-3-540-95891-8_56. The original publication is also available at www.springerlink.com
||compression algorithms; plogon; computational complexity; data
stream algorithms; Lempel-Ziv algorithm; pushdown compression;
||Faculty of Science and Engineering > Computer Science
||13 Apr 2011 15:50
|Journal or Publication Title:
||SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Repository Staff Only(login required)
||Item control page