31 citations · 41 across the 4 of their papers we have counts for
6 papers
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…
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.
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…
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…
Infinite square-free self-shuffling words
Mike Müller, Svetlana Puzynina, Michaël Rao
In this paper we answer two recent questions from Charlier et al. and Harju about self-shuffling words. An infinite word is called self-shuffling, if $w=\prod_{i=0}^\infty U_iV…
Square-Free Shuffles of Words
Tero Harju, Mike Müller
Let $u \shuffle v$ denote the set of all shuffles of the words and . It is shown that for each integer there exists a square-free ternary word of length s…