论文信息 - Parallel algorithms for data compression - 字舞流文

Parallel algorithms for data compression

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

James A. Storer | M. E. Gonzalez Smith

[1] Michael Rodeh,et al. Linear Algorithm for Data Compression via String Matching , 1981, JACM.

[2] Journal of the Association for Computing Machinery , 1961, Nature.

[3] James A. Storer,et al. Data compression via textual substitution , 1982, JACM.

[4] Robert A. Wagner,et al. Common phrases and minimum-space text storage , 1973, CACM.

[5] H. Kucera,et al. Computational analysis of present-day American English , 1967 .

[6] Franco P. Preparata,et al. A Critique and an Appraisal of VLSI Models of Computation. , 1981 .

[7] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[8] Lawrence Snyder,et al. Bounds on minimax edge length for complete binary trees , 1981, STOC '81.

[9] Lynn Conway,et al. Introduction to VLSI systems , 1978 .