Parallel permutation and sorting algorithms and a new generalized connection network

article Free Access Share on Parallel permutation and sorting algorithms and a new generalized connection network Authors: David Nassimi Department of Electrical Engineering and Computer Science, North-western University, Evanston, IL Department of Electrical Engineering and Computer Science, North-western University, Evanston, ILView Profile , Sartaj Sahni Department of Computer Science, 136 Lind Hall, University of Minnesota, Minneapolis, MN Department of Computer Science, 136 Lind Hall, University of Minnesota, Minneapolis, MNView Profile Authors Info & Claims Journal of the ACMVolume 29Issue 3July 1982 pp 642–667https://doi.org/10.1145/322326.322329Published:01 July 1982Publication History 174citation937DownloadsMetricsTotal Citations174Total Downloads937Last 12 Months42Last 6 weeks12 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