Linear Algorithm for Data Compression via String Matching

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Michael Rodeh IBM Israel Scientific Center, Technion City, Haifa, Israel
Vaughan R. Pratt Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA
Shimon Even Department of Computer Science, Technion-IIT, Haifa, Israel
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 28 Issue 1, Jan. 1981
Pages 16-24
ACM New York, NY, USA
table of contents doi>10.1145/322234.322237
Linear Algorithm for Data Compression via String Matching Published by ACM 1981 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 59
· Downloads (cumulative): 1,137
· Citation Count: 38


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