A Critique and an Appraisal of VLSI Models of Computation-Reference-Cited by-同舟云学术

A Critique and an Appraisal of VLSI Models of Computation

Published:1981 Issue: Volume: Page:81-88
ISSN:
Container-title:VLSI Systems and Computations
language:
Short-container-title:

Author:

Bilardi G.,Pracchi M.,Preparata F. P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-68402-9_10.pdf

Reference8 articles.

1. C. A. Mead and L. Conway , Introduction to VLSI Systems, Addison- Wesley, Reading, MA 1979.

2. R. P. Brent and H. T. Kung, “The chip complexity of binary arithmetic,” Proceedings of the 12th Symposium on Theory of Computing, Los Angeles, pp. 190–200; April 1980.

3. C. D. Thompson, “A complexity theory for VLSI,” Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, August 1980.

4. B. Chazelle and L. Monier, “A model of computation for VLSI with related complexity results,” Tech. Rep., Department of Computer Science, Carnegie-Mellon University, February 1981.

5. C. L. Seitz, “System liming,” Chap. 7, in C. Mead and L. Conway, Introduction to VLSI Systems, Addison-Wesley, Reading, MA 1979.

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

1. The applicability of discrete performance estimation methods to VLSI design;Formal Aspects of Computing;1993-03

2. Parallel Architectures For Iterative Image Restoration;Parallel Algorithms and Architectures for DSP Applications;1991

3. Computational Metrics and Fundamental Limits for Parallel Architectures a Survey of Pertinent Research;Frontiers of Computing Systems Research;1990

4. Interconnect Issues;The Kluwer International Series in Engineering and Computer Science;1989

5. Optimal VLSI graph embeddings in variable aspect ratio rectangles;Algorithmica;1988-11