Author:
Bilardi G.,Preparata F. P.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference26 articles.
1. C. D. Thompson,A Complexity Theory for VLSI, Ph.D. Thesis, Dept. of Comp. Science, Carnegie-Mellon University; August 1980.
2. R. B. Johnson, “The complexity of a VLSI adder,”Information Processing Letters, vol. 11, n. 2, pp. 92–93; October 1980.
3. G. M. Baudet, “On the area required by VLSI circuits,” in H. T. Kung, R. Sproull, and G. Steele (eds.),VLSI Systems and Computations, pp. 100–107, Computer Science Press, Rockville, MD; 1981.
4. Z. Kedem, “Optimal allocation of computational resources in VLSI,”Proc. 23rd Annual Symposium on the Foundations of Computer Science, Chicago, IL, pp. 379–386; November 1982.
5. A. El Gamal, J. W. Greene, and K. F. Pang, “VLSI complexity of coding,”Proceedings 1984 Conference on Advanced Research in VLSI, M.I.T., Cambridge, MA; January 1984.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献