On relations between input and communication/computation in VLSI
- 1 October 1981
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A model of computation for VLSI with related complexity resultsPublished by Association for Computing Machinery (ACM) ,1981
- Lower bounds for VLSIPublished by Association for Computing Machinery (ACM) ,1981
- Bounds on minimax edge length for complete binary treesPublished by Association for Computing Machinery (ACM) ,1981
- A combinatorial limit to the computing power of V.L.S.I. circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- The chip complexity of binary arithmeticPublished by Association for Computing Machinery (ACM) ,1980
- Cost and performance of VLSI computing structuresIEEE Journal of Solid-State Circuits, 1979
- Area-time complexity for VLSIPublished by Association for Computing Machinery (ACM) ,1979
- Bristle Blocks: A Silicon CompilerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979