Sorting network

Known as: Comparison network, AKS sorting network, Sorting networks 
In computer science, comparator networks are abstract devices built up of a fixed number of "wires", carrying values, and comparator modules that… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Computer architectures are quickly changing toward heterogeneous many-core systems. Such a trend opens up interesting… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 6
Is this relevant?
1998
1998
This paper provides an analysis of a natural d-round tournamentover n = 2 d players, and demonstrates that the tournament… (More)
Is this relevant?
1993
1993
The bitonic sorting network will sort N-2^m keys in O(log^2N) time with 0(Nlog^2N) comparators. Developments on the sorter enable… (More)
  • figure 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The sorting network described by Ajtaiet al. was the first to achieve a depth ofO(logn). The networks introduced here are… (More)
Is this relevant?
1990
1990
We present a general technique for enhancing the reliability of sorting networks, and other comparator based networks. Our… (More)
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A periodic sorting network consists of a sequence of identical blocks. In this paper, the periodic balanced sorting network… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
1985
1985
Beginning with the recently introduced balanced sorting network, we propose a shuffle-exchange type layout consisting of a single… (More)
  • figure 1-1
Is this relevant?
Highly Cited
1983
Highly Cited
1983
The purpose of this paper is to describe a sorting network of size 0(n log n) and depth 0(log n). A natural way of sorting is… (More)
Is this relevant?
1983
1983
This paper introduces a new sorting network, called the <underline>balanced sorting network</underline>, that sorts n items in… (More)
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1975
Highly Cited
1975
A network which sorts n numbers, when used to sort numbers of only two sizes, 0 and 1, can be regarded as forming the n frontal… (More)
Is this relevant?