A Partitioning Approach to the Design of Selection Networks

Authors:
Benjamin W. Wah; Kuo-Liang Chen
Affiliations:
School of Electrical Engineering, Purdue University;-
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 4
Cited 2

MANIP A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems

IEEE Transactions on Computers
New Parallel-Sorting Schemes

IEEE Transactions on Computers
Sorting networks and their applications

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Time bounds for selection

Journal of Computer and System Sciences

MANIP A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems

IEEE Transactions on Computers
Pairwise cardinality networks

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning

Quantified Score

Hi-index	14.99

Visualization

Abstract

The (m,n) selection problem is defined as the selection of the m smallest numbers in any order from a set of n numbers (m =n). In this paper, we have proposed a class of design procedures for selection networks based on partitioning. Conditions are defined so that the optimal design can be found in polynomial time. The resulting selection network has O([log2n] · [log2m]) time