Information Transfer in Distributed Computing with Applications to VLSI

Authors:
J. JáJá;V. K. Prasanna Kumar
Affiliations:
Electrical Engineering Department, University of Maryland, College Park, MD and The Pennsylvania State University, University Park, Pennsylvania;Department of Electrical Engineering, University of Southern California, Los Angeles, CA and The Pennsylvania State University, University Park, Pennsylvania
Venue:
Journal of the ACM (JACM)
Year:
1984

Information transfer and area-time tradeoffs for VLSI multiplication

Communications of the ACM
Introduction to VLSI Systems

Introduction to VLSI Systems
Lower bounds for VLSI

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The entropic limitations on VLSI computations(Extended Abstract)

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A model of computation for VLSI with related complexity results

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Area-time complexity for VLSI

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
The chip complexity of binary arithmetic

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

Hi-index	0.01