Sorting with two ordered stacks in series.
From MaRDI portal
Recommendations
Cites work
- A Census of Planar Maps
- 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)\)!)
- Classification of forbidden subsequences of length 4
- Enumeration of planar constellations
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Forbidden subsequences
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Restricted permutations
- Sorting twice through a stack
- Sorting Using Networks of Queues and Stacks
Cited in
(28)- Sorted and/or sortable permutations
- Permutations sorted by a finite and an infinite stack in series
- Generating permutations with restricted containers
- Sorting with a forklift
- On the least exponential growth admitting uncountably many closed permutation classes
- 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Stack sorting with increasing and decreasing stacks
- Two first-order logics of permutations
- Stack sorting with restricted stacks
- Passing through a stack \(k\) times with reversals
- Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
- 2-stack sorting is polynomial
- Permutations generated by a stack of depth 2 and an infinite stack in series
- A stack and pop stack in series
- 2-stack sorting is polynomial
- Permutations sortable by two stacks in series
- Two stacks in series: a decreasing stack followed by an increasing stack
- Passing through a stack k times
- scientific article; zbMATH DE number 1836429 (Why is no real title available?)
- Enumeration Schemes for Restricted Permutations
- Sorting with networks of data structures
- On sorting with a network of two stacks
- Permutations generated by stacks and deques
- Foot-sorting for socks
- Sorting twice through a stack
- Sorting inversion sequences
- Set partitions that require a maximum number of sorts through the aba-avoiding stack
This page was built for publication: Sorting with two ordered stacks in series.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853525)
