Optimal bounded-degree VLSI networks for sorting in a constant number of rounds
Hussein Alnuweiri · 1991
Article Free Access Share on Optimal bounded-degree VLSI networks for sorting in a constant number of rounds Author: Hussein M. Alnuweiri Department of Electrical Engineering, The University of British Columbia, Vancouver, B.C., Canada V6T 1Z4 Department of Electrical Engineering, The University of British Columbia, Vancouver, B.C., Canada V6T 1Z4View Profile Authors Info & Claims Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on SupercomputingAugust 1991 Pages 732–739https://doi.org/10.1145/125826.126169Published:01 August 1991Publication History 2citation134DownloadsMetricsTotal Citations2Total Downloads134Last 12 Months4Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF