The following pages link to Stack sortable permutations (Q1170191):
Displaying 18 items.
- Pattern matching for permutations (Q293263) (← links)
- Order-preserving indexing (Q294954) (← links)
- A linear time algorithm for consecutive permutation pattern matching (Q396621) (← links)
- Permutation representation of k-ary trees (Q1062460) (← links)
- The Euler-Catalan identity (Q1110512) (← links)
- A combinatorial proof of J. West's conjecture (Q1584296) (← links)
- Passing through a stack \(k\) times with reversals (Q2323106) (← links)
- Kernelization lower bound for permutation pattern matching (Q2339595) (← links)
- Noncontiguous pattern containment in binary trees (Q2449274) (← links)
- CONSTANT-MEMORY ITERATIVE GENERATION OF SPECIAL STRINGS REPRESENTING BINARY TREES (Q2909202) (← links)
- <i>q</i>-Enumeration of alternating permutations of odd length (Q3062051) (← links)
- Coding Binary Trees by Words over an Alphabet with Four Letters (Q4024145) (← links)
- Generating binary trees in A-order from codewords defined on a four-letter alphabet (Q4321109) (← links)
- Pattern matching for permutations (Q5060113) (← links)
- (Q5060297) (← links)
- (Q5111034) (← links)
- (Q5121952) (← links)
- Restricted permutations (Q5916426) (← links)
