The following pages link to Sorting twice through a stack (Q688711):
Displaying 25 items.
- Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry (Q404464) (← links)
- Operators of equivalent sorting power and related Wilf-equivalences (Q463051) (← links)
- Sorting with networks of data structures (Q602673) (← links)
- 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)\)!) (Q1193435) (← links)
- A combinatorial proof of J. West's conjecture (Q1584296) (← links)
- Symmetry and unimodality in \(t\)-stack sortable permutations (Q1601431) (← links)
- Fighting fish: enumerative properties (Q1745138) (← links)
- Sorting with two ordered stacks in series. (Q1853525) (← links)
- 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers (Q1887043) (← links)
- Permutations with forbidden subsequences and nonseparable planar maps (Q1917517) (← links)
- Stack words, standard tableaux and Baxter permutations (Q1924361) (← links)
- Two first-order logics of permutations (Q2299614) (← links)
- Passing through a stack \(k\) times with reversals (Q2323106) (← links)
- 2-stack sorting is polynomial (Q2363966) (← links)
- Simple permutations and algebraic generating functions (Q2426423) (← links)
- Bubblesort, stacksort and their duals (Q2449088) (← links)
- Fighting fish and two-stack sortable permutations (Q2632714) (← links)
- \(k\)-pop stack sortable permutations and \(2\)-avoidance (Q2662333) (← links)
- Lattice paths and \((n - 2)\)-stack sortable permutations (Q2672927) (← links)
- A bijection between Tamari intervals and extended fighting fish (Q2701000) (← links)
- Fighting fish (Q2958580) (← links)
- On Rearrangement of Items Stored in Stacks (Q3382003) (← links)
- Baxter permutations and plane bipolar orientations (Q5300984) (← links)
- Algorithmic coincidence classification of mesh patterns (Q6040657) (← links)
- Dynamical aspects of \(\sigma\)-machines (Q6098077) (← links)
