39 citations · 161 across the 21 of their papers we have counts for
3 papers · 2 filters
Optimal-Depth Sorting Networks
Daniel Bundala, Michael Codish, Luís Cruz-Filipe +2
We solve a 40-year-old open problem on the depth optimality of sorting networks. In 1973, Donald E. Knuth detailed, in Volume 3 of "The Art of Computer Programming", sorting networ…
Sorting Networks: the End Game
Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp
This paper studies properties of the back end of a sorting network and illustrates the utility of these in the search for networks of optimal size or depth. All previous works focu…
The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes
Michael Codish, Luis Cruz-Filipe, Peter Schneider-Kamp
Previous work identifying depth-optimal -channel sorting networks for is based on exploiting symmetries of the first two layers. However, the naive generate-an…