Foot-sorting for socks
From MaRDI portal
Recommendations
Cites work
- 2-stack sorting is polynomial
- A stack and pop stack in series
- A survey of stack-sorting disciplines
- Asymptotic results on Klazar set partition avoidance
- Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings
- Comparing algorithms for sorting with t stacks in series
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- Counting Pop-Stacked Permutations in Polynomial Time
- Enumerating permutations sortable by \(k\) passes through a pop-stack
- Hereditary properties of partitions, ordered graphs and ordered hypergraphs
- scientific article; zbMATH DE number 5729471 (Why is no real title available?)
- scientific article; zbMATH DE number 3722110 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- Pattern avoidance for set partitions à la Klazar
- Permutations sortable by two stacks in parallel and quarter plane walks
- Pop-stack-sorting for Coxeter groups
- Pop-stacks in parallel
- Restricted stacks as functions
- Sorting Cayley permutations with pattern-avoiding machines
- Sorting Using Networks of Queues and Stacks
- Sorting with two ordered stacks in series.
- Stack sorting with restricted stacks
- Stack-sorting for Coxeter groups
- Stack-sorting for words
- Stack-sorting with consecutive-pattern-avoiding stacks
- Troupes, cumulants, and stack-sorting
- Two-stack-sorting with pop stacks
Cited in
(3)
This page was built for publication: Foot-sorting for socks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614158)