Discrete Lunch‎ > ‎

Dec 1: Sorting networks

posted Nov 28, 2014, 11:07 PM by Dirk Oliver Theis   [ updated Aug 30, 2015, 7:01 AM ]
A sorting network can be thought of as solving the task of sorting a fixed number of inputs by a fixed network of wires and comparators. If realized as an electrical network, a sorting network can perform hardware level sorting.
But sorting networks are also a new cool tool in Algorithms & Theory.

On Monday, DOT will explain what sorting networks are, exactly, and discuss some applications in algorithms and combinatorics. The goal of this lunch session will be to understand the proof--using sorting networks--of a theorem by Kuhn et al on tournaments.