31 citations · 38 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015★ 31 cited
Sorting Networks: to the End and Back Again
Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers +2
This paper studies new properties of the front and back ends of a sorting network, and illustrates the utility of these in the search for new bounds on optimal sorting networks. Se…
cs.DS2014★ 7 cited
Faster Sorting Networks for , and Inputs
Thorsten Ehlers, Mike Müller
We present new parallel sorting networks for to inputs. For and inputs these new networks are faster (i.e., they require less computation steps) than the p…