Parallel algorithms for data compression-Reference-Cited by-同舟云学术

Parallel algorithms for data compression

Published:1985-04 Issue:2 Volume:32 Page:344-373
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Gonzalez Smith M. E.¹,Storer J. A.¹

Affiliation:

1. Brandeis Univ., Waltham, MA

Abstract

Parallel algorithms for data compression by textual substitution that are suitable for VLSI implementation are studied. Both “static” and “dynamic” dictionary schemes are considered.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/3149.3152

Reference12 articles.

1. A Critique and an Appraisal of VLSI Models of Computation

2. KUCERA H. AND FRANCIS W. N.Computational Analysis of Present-Day American English. Brown University Press Providence R.I. 1967. KUCERA H. AND FRANCIS W. N.Computational Analysis of Present-Day American English. Brown University Press Providence R.I. 1967.

3. Linear Algorithm for Data Compression via String Matching

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Alleviating feature fatigue in product development based on the bass model;Journal of Engineering, Design and Technology;2015-07-06

2. Bicriteria Data Compression: Efficient and Usable;Algorithms - ESA 2014;2014

3. On the Bit-Complexity of Lempel--Ziv Compression;SIAM Journal on Computing;2013-01

4. Transparent Online Storage Compression at the Block-Level;ACM Transactions on Storage;2012-05

5. Optimizing LZW text compression algorithm via multithreading programming;2009 IEEE 9th Malaysia International Conference on Communications (MICC);2009-12