37 citations · 39 across the 6 of their papers we have counts for
Showing 2012Show 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.FL2012
Ostrowski Numeration and the Local Period of Sturmian Words
Luke Schaeffer
We show that the local period at position n in a characteristic Sturmian word can be given in terms of the Ostrowski representation for n + 1.