37 citations · 39 across the 6 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2012
An Improved Lower Bound for Stack Sorting
Luke Schaeffer
We consider the problem of sorting elements on a series of stacks, introduced by Tarjan and Knuth. We improve the asymptotic lower bound for the number of stacks necessary to sort…
cs.DM2011★ 2 cited
Avoiding Three Consecutive Blocks of the Same Size and Same Sum
Julien Cassaigne, James D. Currie, Luke Schaeffer +1
We show that there exists an infinite word over the alphabet {0, 1, 3, 4} containing no three consecutive blocks of the same size and the same sum. This answers an open problem of…