Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression

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.

• Type: Conference
• Year: 2009
• Where: SOFSEM
• Authors: Elvira Mayordomo, Philippe Moser
• Keywords: Lempel-Ziv Compression Algorithm, Online Compression Algorithms, Pushdown Compressors, SOFSEM 2009, Theoretical Computer Science