Improved sorting networks with O(log n) depth

Abstract

The sorting network described by Ajtai, KomlOs and Szemeredi was the first to achieve a depth of O(Iog n). The networks introduced here are simplifications and improvements based strongly on their work. While the constants obtained for the depth bound still prevent the construction being of practical value, the structure of the presentation offers a convenient basis for further development