Information transfer and area-time tradeoffs for VLSI multiplication
Communications of the ACM
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
The VLSI Complexity of Selected Graph Problems
Journal of the ACM (JACM)
A model of computation for VLSI with related complexity results
Journal of the ACM (JACM)
Aspects of information flow in VLSI circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Tradeoffs for VLSI models with subpolynomial delay
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Lower bounds on communication complexity in distributed computer networks
Journal of the ACM (JACM)
On the communication complexity of graph properties
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Energy consumption in VLSI circuits
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The Organization of Permutation Architectures with Bused Interconnections
IEEE Transactions on Computers
A coding theorem for distributed computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The linear-array conjecture in communication complexity is false
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A characterization of span program size and improved lower bounds for monotone span programs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Information Transfer in Distributed Computing with Applications to VLSI
Journal of the ACM (JACM)
Cellular automata: energy consumption and physical feasibility
Fundamenta Informaticae - Special issue on cellular automata
A layout strategy for VLSI which is provably good (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Lower bounds on communication complexity
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A characterization of span program size and improved lower bounds for monotone span programs
Computational Complexity
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
The impact of the nanoscale on computing systems
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Area-Time Optimal Fast Implementation of Several Functions in a VLSI Model
IEEE Transactions on Computers
IEEE Transactions on Computers
The VLSI Complexity of Sorting
IEEE Transactions on Computers
The organization of permutation architectures with bussed interconnections
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Partition Arguments in Multiparty Communication Complexity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
Communication lower bounds via the chromatic number
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
A Systolic Design for Connectivity Problems
IEEE Transactions on Computers
Cellular Automata: Energy Consumption and Physical Feasibility
Fundamenta Informaticae - Cellular Automata
Hi-index | 0.02 |
Increased use of Very Large Scale Integration (VLSI) for the fabrication of digital circuits has led to increased interest in complexity results on the inherent VLSI difficulty of various problems. Lower bounds have been obtained for problems such as integer multiplication [1,2], matrix multiplication [7], sorting [8], and discrete Fourier transform [9], all within VLSI models similar to one originally developed by Thompson [8,9]. The lower bound results all pertain to a space-time trade-off measure that arises naturally within this model. In this paper, we extend the model and the class of functions for which non-trivial bounds can be proved. In Section 2, we give a more general model than has been proposed previously. In Section 3 we show how to reduce the derivation of lower bounds within the model to a problem in distributed computing In Section 4, we consider lower bounds for a number of predicates: n-input, l-output functions (as contrasted with the n-input, n-output functions which have been studied previously). In Section 5, we show that previous lower bound results (for n-input, n-output functions) also apply even when the model is extended to allow nondeterminism, randomness, and multiple arrivials. Finally, the full details of the results presented here will appear in the final version of this paper.