Optimal bounded-degree VLSI networks for sorting in a constant number of rounds

Authors:
Hussein M. Alnuweiri
Affiliations:
Department of Electrical Engineering, The University of British Columbia, Vancouver, B.C., Canada V6T 1Z4
Venue:
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Year:
1991

The VLSI optimality of the AKS sorting network

Information Processing Letters
Sorting and selecting in rounds

SIAM Journal on Computing
Tight bounds on the complexity of parallel sorting

IEEE Transactions on Computers
A minimum area VLSI network for O(log n) time sorting

IEEE Transactions on Computers
Parallel Sorting in Two-Dimensional VLSI Models of Computation

IEEE Transactions on Computers
Bounds to Complexities of Networks for Sorting and for Switching

Journal of the ACM (JACM)
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
New layouts for the shuffle-exchange graph(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
An 0(n log n) sorting network

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

Computational Aspects of VLSI

Hi-index	0.01