Aspects of information flow in VLSI circuits

The Influence of Key Length on the Area-Time Complexity of Sorting

Proceedings of the 12th Colloquium on Automata, Languages and Programming

Communication complexity

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

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

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

A minimum area VLSI network for O(logn) time sorting

STOC '84 Proceedings of the sixteenth 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

On notions of information transfer in VLSI circuits

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

A complexity theory for VLSI

A complexity theory for VLSI

The area-time complexity of sorting (algorithms, computation, architecture, vlsi)

The area-time complexity of sorting (algorithms, computation, architecture, vlsi)

Computational Aspects of VLSI

Computational Aspects of VLSI