Mayordomo, Elvira and Moser, Philippe (2009) Polylog space compression is incomparable with Lempel-Ziv and pushdown compression. In: SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science. Springer verlag, Berlin, pp. 633-644. ISBN 9783540958901

Download (184kB)

Abstract

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.

Item Type:	Book Section
Additional Information:	© 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
Keywords:	compression algorithms; plogon; computational complexity; data stream algorithms; Lempel-Ziv algorithm; pushdown compression;
Academic Unit:	Faculty of Science and Engineering > Computer Science
Item ID:	2498
Identification Number:	doi>10.1007/978-3-540-95891-8_56
Depositing User:	CS Editor
Date Deposited:	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
Publisher:	Springer verlag
Refereed:	No
Funders:	Spanish Government MEC, European Regional Development Fund (ERDF) under Project TIN 2005-08832-C03-02
URI:	http://portal.acm.org/dl.cfm?coll=portal...
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

Repository Staff Only(login required)

Item control page

Downloads

Origin of downloads