On the bit-complexity of Lempel-Ziv compression

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Paolo Ferragina University of Pisa, Italy
Igor Nitto University of Pisa, Italy
Rossano Venturini University of Pisa, Italy
Published in:
· Proceeding
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Pages 768-777
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2009
table of contents
On the bit-complexity of Lempel-Ziv compression 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 28
· Downloads (cumulative): 237
· Citation Count: 5


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder