31 citations · 41 across the 5 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
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…
cs.DM2014
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…
cs.DM2013
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…