Author:
Ďuriš Pavol,Sýkora Ondrej,Thompson Clark D.,Vrto Imrich
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference20 articles.
1. G. Baudet, On the area required by VLSI circuits, inVLSI Systems and Computations (H. T. Kung, R. Sproull, and G. Steele, eds.), Computer Science Press, 1981, pp. 100–107.
2. G. Bilardi, The area-time complexity of sorting, ACT-52, Ph.D. Dissertation, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 1984.
3. G. Bilardi, M. Pracchi, and F. P. Preparata, A critique of network speed in VLSI models of computation,IEEE J. Solid-State Circuits,17 (1982), 696–702.
4. R. Brent and H. T. Kung, The area-time complexity of binary multiplication,J. Assoc. Comput. Mach.,28 (1981), 521–534.
5. B. Chazelle and L. Monier, A model of computation for VLSI with related complexity results,Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981, pp. 318–325.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献