31 citations · 41 across the 5 of their papers we have counts for
Showing 2015Show all
3 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.FL2015★ 3 cited
Fully bordered words
Štěpán Holub, Mike Müller
We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes.
cs.DM2015
New Bounds on Optimal Sorting Networks
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…