From Electron Mobility to Logical Structure: A View of Integrated Circuits
ACM Computing Surveys (CSUR)
Introduction to VLSI Systems
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The chip complexity of binary arithmetic
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Fourier Transforms in VLSI
A complexity theory for VLSI
The VLSI Complexity of Selected Graph Problems
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
On driving many long wires in a VLSI layout
Journal of the ACM (JACM)
Tradeoffs for VLSI models with subpolynomial delay
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Efficient embeddings of binary trees in VLSI arrays
IEEE Transactions on Computers
IEEE Transactions on Computers
On Implementing Large Binary Tree Architectures in VLSI and WSI
IEEE Transactions on Computers
Extreme Area-Time Tradeoffs in VLSI
IEEE Transactions on Computers
Spatial machines: a more realistic approach to parallel computation
Communications of the ACM
Information Transfer in Distributed Computing with Applications to VLSI
Journal of the ACM (JACM)
A VLSI layout for a pipelined Dadda multiplier
ACM Transactions on Computer Systems (TOCS)
A layout strategy for VLSI which is provably good (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
IEEE Transactions on Computers
The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors
IEEE Transactions on Computers
Integration, the VLSI Journal
An architecture for a VLSI FFT processor
Integration, the VLSI Journal
VLSI Sorting with Reduced Hardware
IEEE Transactions on Computers
| Hi-index | 0.04 |
We propose a new model of computation for VLSI which is a refinement of previous models and makes the additional assumption that the time for propagating information is linear in the distance. Our approach is motivated by the failure of previous models to allow for realistic asymptotic analysis. While accommodating for basic laws of physics, this model tries to be most general and technology-independent. Thus, from a complexity viewpoint, it is especially suited for deriving lower bounds and trade-offs. We present new results for a number of problems including fan-in, addition, transitive functions, matrix multiplication, and sorting.