Sorting Networks of Logarithmic Depth,Further Simplified
Authors:
Joel Seiferas
Affiliation:
(1) Computer Science Department, University of Rochester, Rochester, NY 14627-0226, USA
Abstract:
We further simplify Paterson’s version of the Ajtai–Komlós–Szemerédi sorting network, and its analysis, mainly by tuning the invariant to be maintained.