The following pages link to (Q4074820):
Displayed 11 items.
- Sorting with networks of data structures (Q602673) (← links)
- Sorting twice through a stack (Q688711) (← links)
- The enumeration of permutations sortable by pop stacks in parallel (Q987841) (← links)
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes (Q990104) (← links)
- Permutations generated by token passing in graphs (Q1391529) (← links)
- Regular closed sets of permutations. (Q1426439) (← links)
- On the least exponential growth admitting uncountably many closed permutation classes (Q1885903) (← links)
- Forbidden substructures and combinatorial dichotomies: WQO and universality (Q2275384) (← links)
- Restricted permutations (Q5906401) (← links)
- Permutations of a multiset avoiding permutations of length 3 (Q5952148) (← links)
- Priority queues with binary priorities (Q5958116) (← links)