Sorting twice through a stack
From MaRDI portal
Recommendations
- Two-stack-sorting with pop stacks
- Sorting with two ordered stacks in series.
- Stack sorting with increasing and decreasing stacks
- Stack sorting with restricted stacks
- Manipulating multiple stacks with ordered-heap
- Stack-sorting with consecutive-pattern-avoiding stacks
- 2-stack sorting is polynomial
- 2-stack sorting is polynomial
- Bubblesort, stacksort and their duals
- On rearrangement of items stored in stacks
Cites work
- scientific article; zbMATH DE number 3176961 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3492580 (Why is no real title available?)
- scientific article; zbMATH DE number 3448641 (Why is no real title available?)
- A Census of Planar Maps
- A Census of Slicings
- A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
- Restricted permutations
Cited in
(44)- Pop-stack sorting and its image: permutations with overlapping runs
- Permutations restricted by two distinct patterns of length three
- Passing through a stack \(k\) times with reversals
- Fertility monotonicity and average complexity of the stack-sorting map
- Stack words, standard tableaux and Baxter permutations
- Two first-order logics of permutations
- Sorting with a popqueue
- Simple permutations and algebraic generating functions
- Highly sorted permutations and Bell numbers
- 2-stack sorting is polynomial
- Baxter permutations
- Fighting fish: enumerative properties
- A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
- Algorithmic coincidence classification of mesh patterns
- Fighting fish
- 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers
- Sorting with networks of data structures
- On rearrangement of items stored in stacks
- A combinatorial proof of J. West's conjecture
- Sorted and/or sortable permutations
- Symmetry and unimodality in \(t\)-stack sortable permutations
- Descents on nonnesting multipermutations
- Stack sorting with increasing and decreasing stacks
- Permutations with forbidden subsequences and nonseparable planar maps
- 2-stack sorting is polynomial
- Passing through a stack k times
- Fighting fish and two-stack sortable permutations
- A survey of stack sortable permutations
- A bijection between Tamari intervals and extended fighting fish
- Operators of equivalent sorting power and related Wilf-equivalences
- Bijections between fighting fish, planar maps, and Tamari intervals
- Baxter permutations and plane bipolar orientations
- Sorting Cayley permutations with pattern-avoiding machines
- Refined enumeration of permutations sorted with two stacks and a D₈-symmetry
- Lattice paths and \((n - 2)\)-stack sortable permutations
- New equivalences for pattern avoiding involutions
- A new lower bound for deterministic pop-stack-sorting
- Dynamical aspects of \(\sigma\)-machines
- Enumeration of permutations sorted with two passes through a stack and \(D_{8}\) symmetries
- scientific article; zbMATH DE number 1792663 (Why is no real title available?)
- \(k\)-pop stack sortable permutations and \(2\)-avoidance
- scientific article; zbMATH DE number 7524066 (Why is no real title available?)
- Bubblesort, stacksort and their duals
- Sorting with two ordered stacks in series.
This page was built for publication: Sorting twice through a stack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688711)
