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

Aspects of information flow in VLSI circuits

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing

Lower bounds on communication complexity in distributed computer networks

Journal of the ACM (JACM)

Optimal VLSI circuits for sorting

Journal of the ACM (JACM)

Size-time complexity of Boolean networks for prefix computations

Journal of the ACM (JACM)

Processor networks and interconnection networks without long wires

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures

Processor networks and interconnection networks without long wires (extended abstract)

ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures

Robust bounded-degree networks with small diameters

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures

A New Class of Optimal Bounded-Degree VLSI Sorting Networks

IEEE Transactions on Computers

Deterministic on-line routing on area-universal networks

Journal of the ACM (JACM)