Space-conscious compression

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4708 LNCS, Issue , 2007, Pages 206-217

  Gagie, Travis ^a   Manzini, Giovanni ^a  

^a UNIVERSITY OF EASTERN PIEDMONT   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER OPERATING SYSTEMS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; STORAGE ALLOCATION (COMPUTER);

COMPRESSION ALGORITHMS; CONVERGENCE RATE; MEMORY LIMITATIONS; SLIDING WINDOW;

DATA COMPRESSION;

EID: 38049057885     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74456-6_20     Document Type: Conference Paper

References (14)

1. Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proceedings of the 21st Symposium on Principles of Database Systems, pp. 1-16 (2002)
2. Bentley, J.L., Sleator, D.D., Tarjan, R.E., Wei, V.K.: A locally adaptive data compression scheme. Communications of the ACM 29, 320-330 (1986)
3. Gagie, T.: Large alphabets and incompressibility. Information Processing Letters 99, 246-251 (2006)
4. Gagie, T., Manzini, G.: Space-conscious compression. Technical Report TR-INF-2007-06-02, Università del Piemonte Orientale (2007)
5. Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proceedings of the IRE 40, 1098-1101 (1952)
6. Kosaraju, R., Manzini, G.: Compression of low entropy strings with Lempel-Ziv algorithms. SIAM Journal on Computing 29(3), 893-911 (1999)
7. Larsson, N.J.: Extended application of suffix trees to data compression. In: DCC '96: Proceedings of the Conference on Data Compression, Washington, DC, USA, p. 190. IEEE Computer Society Press, Los Alamitos (1996)
8. Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, Heidelberg (1997)
9. Munro, J.I., Paterson, M.S.: Selection and sorting with limited storage. Theoretical Computer Science 12, 315-323 (1980)
10. Muthukrishnan, S.: Data Streams: Algorithms and Applications. Now Publishers, See also: http://www.nowpublishers.com/tcs/ (2005)
11. Na, J.C., Apostolico, A., Iliopoulos, C., Park, K.: Truncated suffix trees and their application to data compression. Theor. Comput. Sci. 304(1-3), 87-101 (2003)
12. Rissanen, J.: Generalized Kraft inequality and arithmetic coding. IBM Journal of Research and Development 20, 198-203 (1976)
13. Rosenfeld, V.R.: Enumerating De Bruijn sequences. MATCH Communications in Mathematical and in Computer Chemistry 45, 71-83 (2002)
14. Wyner, A.J.: The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm. IEEE Transactions on Information Theory 43, 1452-1464 (1997)