Parallel Algorithms for Data Compression

Journal of the ACM (JACM)

Volumn 32, Issue 2, 1985, Pages 344-373

  Gonzalez Smith, M E ^a,b   Storer, J A ^a  

^a BRANDEIS UNIVERSITY   (United States)

^b Cornell University ^*  (United States)

Author keywords

Data compression; distributed processors; parallel Algorithm; textual substitution; VLSI

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING;

DATA COMPRESSION; PARALLEL ALGORITHMS;

COMPUTER PROGRAMMING;

EID: 0022045174     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/3149.3152     Document Type: Article

References (13)

1. BILARDI, G., PRACCHI, M., AND PREPARATA, F. P. A critique and appraisal of VLSI models of computation. In Conference on VLSI Systems and Computations. Carnegie-Mellon Univ., Pittsburgh, Pa., 1981, pp. 81-88.
2. KIJCERA, H., AND FRANCIS, W. N. Computational Analysis of Present-Day American English. Brown University Press, Providence, RI., 1967.
3. MEAD, C., AND CONWAY, L. Introduction to VLSI Systems. Addison-Wesley, Reading, Mass., 1982.
4. PATTERSON, M. S., Ruzzo, W. L., AND SNYDER, L. Bounds on minimax edge length for complete binary trees. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing (Milwaukee, Wise., May 11-13). ACM, New York, pp. 293-299.
5. RODEH, M., PRATT, V. R., AND EVEN, S. Linear algorithm for data compression via string matching. J. ACM 28, 1 (Jan. 1981), 16-24.
6. SEERY, J. B., AND ZIV, J. A universal data compression algorithm: Description and preliminary results. Tech. Memorandum 77-1212-6. Bell Laboratories, Murray Hill, N.J., 1977.
7. SEERY, J. B., AND Zrv, J. Further results on universal data compression. Tech. Memorandum 78-1212-8. Bell Laboratories, Murray Hill, N.J., 1978.
8. SHANNON, C. E. Prediction of entropy of printed English text. In Key Papers in the Development of information Theory, D. Slepian, Ed. IEEE, New York, 1973, pp. 42-46.
9. STORER, J. A. NP-completeness results concerning data compression. Tech. Rep. 234. Dept. Electrical Engineering and Computer Sci., Princeton Univ., Princeton, N.J., 1977.
10. STORER, J. A. Combining pipes and trees in VLSI. Tech. Rep. CS-82-107. Dept. Computer Sci., Brandeis Univ., Waltham, Mass., 1982.
11. STORER, J. A., AND SZYMANSKI, T. G. Data compression via textual substitution. J. ACM 29, 4 (Oct. 1982), 928-95 1.
12. WAGNER, R. A. Common phrases and minimum-space text storage. Commun. ACM 16, 3 (Mar. 1973), 148-152.
13. ZIV, J., AND LEMPEL, A. A universal algorithm for sequential data compression. IEEE Trans. Inf: Theory 23, 3 (1977), 337-343.