Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

35 relations
Batcher odd–even mergesortBitonic sorterBubble sortBus (computing)

Broader (1)

Computer engineering

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Efficient SAT-based dynamic compaction and relaxation for longest sensitizable paths
Comprehensive coverage of small-delay faults under massive process variations is achieved when multiple paths through the fault… 
2011
2011
Designing Sorting Networks
Designing Sorting Networks: A New Paradigm provides an in-depth guide to maximizing the efficiency of sorting networks, and uses… 
1996
1996
Optimal Sorting of Seven Element Sets
A long standing open problem of determining the average-case comparison complexity of sorting seven element sets is solved. It… 
1996
1996
A novel class of sorting networks
A novel class of Very Fast Sorting Networks based on the theoretical properties of sorting is presented. The sorting algorithm… 
1995
1995
On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks
The sizes of permutation networks for special sets of permutations are investigated. The study of the planar realization and the… 
1994
1994
Periodic Constant Depth Sorting Networks
Comparator networks of constant depth can be used for sorting in the following way. The computation consists of a number of… 
1994
1994
2d-bubblesorting in average time O(√N lg N)*
We study the complexity of a natural generalization of the parallel odd-even transposition sort to 2-dimensional meshconnected… 
1992
1992
A parallel sorting network without comparators: A neural network approach
The design of a parallel sorting network that does not use any comparators is described. The network consists of a two… 
1990
1990
A fault-tolerant two-dimensional sorting network
  • J. KrammerH. Arif
  • [] Proceedings of the International Conference on…
  • 1990
  • Corpus ID: 61449121
The authors evaluate a class of sorting algorithms which can be adapted to a faulty network with nearest neighbor… 
Review
1985
Review
1985
Electronic Data Sorting
This paper presents results of a study of the fundamentals of sorting. Emphasis is placed on understanding sorting and on… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)