Parallel algorithms for data compression
- 1 April 1985
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 32 (2), 344-373
- https://doi.org/10.1145/3149.3152
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.Keywords
This publication has 4 references indexed in Scilit:
- Data compression via textual substitutionJournal of the ACM, 1982
- A Critique and an Appraisal of VLSI Models of ComputationPublished by Springer Science and Business Media LLC ,1981
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981
- Common phrases and minimum-space text storageCommunications of the ACM, 1973