Planar Circuit Complexity and The Performance of VLSI Algorithms +
- 1 January 1981
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Area-time optimal VLSI networks for multiplying matricesInformation Processing Letters, 1980
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- Information transfer and area-time tradeoffs for VLSI multiplicationCommunications of the ACM, 1980
- Time-space tradeoffs for computing functions, using connectivity properties of their circuitsPublished by Association for Computing Machinery (ACM) ,1978
- Bounds to Complexities of Networks for Sorting and for SwitchingJournal of the ACM, 1975
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972