The VLSI optimality of the AKS sorting network

Authors:
G. Bilardi;F. P. Preparata
Affiliations:
Univ. of Illinois at Urbana-Champaign, Urbana;Univ. of Illinois at Urbana-Champaign, Urbana
Venue:
Information Processing Letters
Year:
1985

Citing 0
Cited 4

Optimal VLSI circuits for sorting

Journal of the ACM (JACM)
Optimal bounded-degree VLSI networks for sorting in a constant number of rounds

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
A New Class of Optimal Bounded-Degree VLSI Sorting Networks

IEEE Transactions on Computers
Improved routing and sorting on multibutterflies

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.89

Visualization

Abstract