5 citations · 5 across the 3 of their papers we have counts for
3 papers
math.CO2013
2-Stack Sorting is polynomial
Adeline Pierrot, Dominique Rossin
In this article, we give a polynomial algorithm to decide whether a given permutation is sortable with two stacks in series. This is indeed a longstanding open problem which wa…
cs.DM2013★ 5 cited
2-stack pushall sortable permutations
Adeline Pierrot, Dominique Rossin
In the 60's, Knuth introduced stack-sorting and serial compositions of stacks. In particular, one significant question arise out of the work of Knuth: how to decide efficiently if…
cs.DS2013
Single and multiple consecutive permutation motif search
Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot +1
Let be a permutation (that shall play the role of the {\em text}) on and a pattern be a sequence of distinct integer(s) of , . The pattern occur…