AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the condition that each stack remains ordered. A forbidden characterisation of such permutations is obtained and the number of permutations of each length is determined by a generating function
International audienceGeneralizing stack sorting and c-sorting for permutations, we define the permu...
We prove that the class of permutations generated by passing an ordered sequence 12...n through a st...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
Stacks which allow elements to be pushed into any of the top r positions and popped from any of the ...
We consider the set of permutations that are sortable after two passes through a pop stack. We chara...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
AbstractWe consider the operation of stack-sorting studied by Knuth. We take the point of view that ...
In the 60’s, Knuth introduced stack-sorting and serial compositions of stacks. In par-ticular, one s...
We prove that the set of permutations generated by a stack of depth two and an infinite stack in ser...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1990.Includes bibliogr...
© Springer International Publishing AG, part of Springer Nature 2018. We prove that the set of permu...
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, ...
Lower and upper bounds are given for the the number of permutations of length n generated by two sta...
We examine the sets of permutations that are sorted by two passes through a stack with a $D_8$ opera...
International audienceGeneralizing stack sorting and c-sorting for permutations, we define the permu...
We prove that the class of permutations generated by passing an ordered sequence 12...n through a st...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
Stacks which allow elements to be pushed into any of the top r positions and popped from any of the ...
We consider the set of permutations that are sortable after two passes through a pop stack. We chara...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
AbstractWe consider the operation of stack-sorting studied by Knuth. We take the point of view that ...
In the 60’s, Knuth introduced stack-sorting and serial compositions of stacks. In par-ticular, one s...
We prove that the set of permutations generated by a stack of depth two and an infinite stack in ser...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1990.Includes bibliogr...
© Springer International Publishing AG, part of Springer Nature 2018. We prove that the set of permu...
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, ...
Lower and upper bounds are given for the the number of permutations of length n generated by two sta...
We examine the sets of permutations that are sorted by two passes through a stack with a $D_8$ opera...
International audienceGeneralizing stack sorting and c-sorting for permutations, we define the permu...
We prove that the class of permutations generated by passing an ordered sequence 12...n through a st...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
DOI
Add to ORKG