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
A Dynamic Generalization of Becker's Assortative Matching Result
Abstract This paper considers a dynamic matching model in which each agent's future productivity depends in part on their current… 
2005
2005
The inter-American metrology system (SIM) common-view GPS comparison network
The inter-American metrology system (SIM) consists of national metrology institutes in 34 member nations located throughout North… 
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… 
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… 
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly… 
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… 
1992
1992
Lecture Notes on the New AKS Sorting Network
Ajtai, Komlós, and Szemerédi constructed sorting networks with N wires of depth O(logN ). They were not concerned with the value… 
Highly Cited
1985
Highly Cited
1985
A Robust Sorting Network
Beginning with the recently introduced balanced sorting network, we propose a shuffle-exchange type layout consisting of a single… 
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)