13 citations · 39 across the 22 of their papers we have counts for
Showing 2005Show all
3 papers · 1 filter
math.CO2005
Restricted Patience Sorting and Barred Pattern Avoidance
Alexander Burstein, Isaiah Lankham
Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors have shown that…
math.CO2005
A Geometric Form for the Extended Patience Sorting Algorithm
Alexander Burstein, Isaiah Lankham
Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors extended Patien…
math.CO2005★ 13 cited
Combinatorics of patience sorting piles
Alexander Burstein, Isaiah Lankham
Despite having been introduced in 1962 by C.L. Mallows, the combinatorial algorithm Patience Sorting is only now beginning to receive significant attention due to such recent deep…