Area-time lower-bound techniques with applications to sorting

Size-time complexity of Boolean networks for prefix computations

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing

Optimal VLSI circuits for sorting

Journal of the ACM (JACM)

Size-time complexity of Boolean networks for prefix computations

Journal of the ACM (JACM)

A New Class of Optimal Bounded-Degree VLSI Sorting Networks

IEEE Transactions on Computers

AT2 bounds for a class of VLSI problems and string matching

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures

Deterministic on-line routing on area-universal networks

Journal of the ACM (JACM)

On the Lower Bound to the VLSI Complexity of Number Conversion from Weighted to Residue Representation

IEEE Transactions on Computers

The potential of on-chip multiprocessing for QCD machines

HiPC'05 Proceedings of the 12th international conference on High Performance Computing

New area-time lower bounds for the multidimensional DFT

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119