AN ANALYSIS OF SORTING NETWORKS

Authors:
B. J. Smith
Affiliations:
-
Venue:
AN ANALYSIS OF SORTING NETWORKS
Year:
1972

Citing 0
Cited 2

Ultracomputers

ACM Transactions on Programming Languages and Systems (TOPLAS)
Interconnection networks: a survey and assessment

AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Comparators which sort two numbers can be interconnected to form networks which sort n numbers for any n. The input and output characteristics of comparator networks are analyzed from several different points of view.