On the bit-complexity of Lempel-Ziv compression

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 768-777

  Ferragina, Paolo ^a   Nitto, Igor ^a   Venturini, Rossano ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

BIT COMPLEXITY; COMPRESSION PROCESS; COMPRESSION SCHEME; INPUT STRING; LOSSLESS DATA COMPRESSION; OPTIMAL SPACE; STATE OF THE ART; SUB-STRINGS;

COMPRESSORS;

EID: 70349245090     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.84     Document Type: Conference Paper

References (38)

1. A. Amir, G. M. Landau, and E. Ukkonen. On-line timestamped text indexing. Inf. Process. Lett., 82(5):253-259, 2002.
2. P. Beame and P. E. Fich. Optimal bounds for the predecessor problem. In Procs ACMSTOC, pages 295-304, 1999.
3. J. Bekesi, G. Galambos, U. Pferschy, and G.J. Woeginger. Greedy algorithms for on-line data compression. Journal of Algorithms, 25(2):274-289, 1997. (Pubitemid 127451765)
4. P. Boldi, B. Codenotti, M. Santini, and S. Vigna. Ubicrawler: A scalable fully distributed web crawler. Software: Practice & Experience, 34(8):711-726, 2004.
5. R. Cilibrasi and P. M. B. Vitányi. Clustering by compression. IEEE Transactions on Information Theory, 51(4):1523-1545, 2005.
6. M. Cohn and R. Khazan. Parsing with prefix and suffix dictionaries. In Procs IEEE DCC, pages 180-189, 1996.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company, 2001.
8. G. Cormode and S. Muthukrishnan. Substring compression problems. In Procs ACM-SIAM SODA, pages 321-330, 2005.
9. M. Crochemore, L. Ilie, and W. F. Smyth. A simple algorithm for computing the Lempel-Ziv factorization. In Procs IEEE DCC, pages 482-488, 2008.
10. G. Della Penna, P. Mignosi, A. Langiu, and A. Ulisse. On dictionary-symbolwise data compression. Personal Communication, 2008.
11. P. Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, 21(2):194-203, 1975.
12. P. Penwick. Universal codes. In Lossless Compression Handbook, pages 55-78. Academic Press, 2003.
13. P. Ferragina, R. Giancarlo, and G. Manzini. The engineering of a compression boosting library: Theory vs practice in bwt compression. In Procs ESA, LNCS 4168, Springer, pages 756-767, 2006. (Pubitemid 44699696)
14. P. Ferragina, R. Giancarlo, G. Manzini, and M. Sciortino. Boosting textual compression in optimal linear time. Journal of the ACM, 52:688-713, 2005. (Pubitemid 43078375)
15. P. Ferragina and G. Navarro. Site pizza&chili (http://pizzachili.di. unipi.it or http://pizzachili.dec.uchile.cl).
16. E. R. Fiala and D. H. Greene. Data compression with finite windows. Communications of the ACM, 32(4):490-505, 1989.
17. T. Gagie and G. Manzini. Space-conscious compression. In Procs MFCS, LNCS 4708, Springer, pages 206-217, 2007.
18. R. F. Geary, R. Raman, and V. Raman. Succinct ordinal trees with level-ancestor queries. ACM Transactions on Algorithms, 2(4):510-534, 2006. (Pubitemid 46174059)
19. Gzip home page. http://www.gzip.org.
20. J. Katajainen and T. Raita. An approximation algorithm for space-optimal encoding of a text. Computer Journal, 32(3):228-237, 1989. (Pubitemid 20625344)
21. J. Katajainen and T. Raita. An analysis of the longest match and the greedy heuristics in text encoding. Journal of the ACM, 39(2):281-294, 1992. (Pubitemid 23600407)
22. S. T. Klein. Efficient optimal recompression. Computer Journal, 40(2/3):117-126, 1997.
23. R. Kosaraju and G. Manzini. Compression of low entropy strings with Lempel-Ziv algorithms. SIAM Journal on Computing, 29(3):893-911, 1999. (Pubitemid 30891920)
24. M. Lewenstein, V., Mäkinen, and S. J. Puglisi. Personal communications.
25. Y. Matias and S.C. Şahinalp. On the optimality of parsing in dynamic dictionary based data compression. In Procs ACM-SIAM SODA, pages 943-944, 1999.
26. E. M. McCreight. Priority search trees. SIAM Journal on Computing, 14(2):257-276, 1985.
27. G. Navarro and V. Mäkinen. Compressed full-text indexes. ACM Computing Surveys, 39(1), 2007.
28. N. Rajpoot and C. Sahinalp. Handbook of Lossless Data Compression, chapter Dictionary-based data compression, pages 153-167. Academic Press, 2002.
29. D. Salomon. Data Compression: the Complete Reference, 4th Edition. Springer Verlag, 2006.
30. E. J. Schuegraf and H. S. Heaps. A comparison of algorithms for data base compression by use of fragments as language elements. Information Storage and Retrieval, 10(9-10):309319, 1974.
31. M. E. Gonzalez Smith and J. A. Storer. Parallel algorithms for data compression. Journal of the ACM, 32(2):344-373, 1985.
32. W. Szpankowski. Asymptotic properties of data compression and suffix trees. IEEE Transactions on Information Theory, 39(5):1647-1659, 1993.
33. J. S. Vitter and P. Krishnan. Optimal prefetching via data compression. Journal of the ACM, 43(5):771-793, 1996. (Pubitemid 126607644)
34. D. E. Willard. Examining computational geometry, van emde boas trees, and hashing from the perspective of the fusion tree. SIAM. Journal on Computing, 29(3), 2000.
35. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, Los Altos, CA 94022, USA, second edition, 1999.
36. J. Ziv. Classification with finite memory revisited. IEEE Transactions on Information Theory, 53(12):4413-4421, 2007.
37. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transaction on Information Theory, 23:337-343, 1977.
38. J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory, 24(5):530-536, 1978. (Pubitemid 8631609)