Parallel algorithms for data compression

descriptionPublicationkeyboard_double_arrow_right Article 01 Apr 1985 English Publisher:Association for Computing Machinery (ACM)Journal:Journal of the ACM, volume 32, pages 344-373 (issn: 0004-5411, eissn: 1557-735X,

Copyright policy )

Authors: M. E. Gonzalez Smith; James A. Storer;

doi: 10.1145/3149.3152

Parallel algorithms for data compression

- Summary
- Subjects
- Metrics

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.

Related Organizations

Brandeis University
United States

Keywords

textual substitution, Parallel algorithms, distributed processors, Information theory (general), data compression, Theory of operating systems, VLSI

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	53
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average