Boosting textual compression in optimal linear time

doi:10.1145/1082036.1082043

Boosting textual compression in optimal linear time

Full Text:

PDF

Buy this Article

Authors:	Paolo Ferragina	Università di Pisa, Pisa, Italy
	Raffaele Giancarlo	Università di Palermo, Palermo, Italy
	Giovanni Manzini	Università del Piemonte Orientale, Alessandria, Italy
	Marinella Sciortino	Università di Palermo, Palermo, Italy

	2005 Article
Bibliometrics
· Downloads (6 Weeks): 5 · Downloads (12 Months): 37 · Downloads (cumulative): 927 · Citation Count: 32

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 52 Issue 4, July 2005
Pages 688-713
ACM New York, NY, USA
table of contents doi>10.1145/1082036.1082043

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms arithmetic coding burrows--wheeler transform combinatorial algorithms data compaction and compression data warehouse and repository design empirical entropy huffman coding lempel--ziv compressors storage management suffix tree text compression theory

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

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