Cited in
(15)- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
- Two examples of unbalanced Wilf-equivalence
- Egge triples and unbalanced Wilf equivalence
- A stack and pop stack in series
- The enumeration of permutations avoiding 3124 and 4312
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Pattern-avoiding involutions: exact and asymptotic enumeration
- Inflations of geometric grid classes: three case studies
- Permutation patterns in genome rearrangement problems: the reversal model
- Stack sorting with increasing and decreasing stacks
- InsEnc
- automata
- BinaryTrees
- A simple proof of a theorem of Schmerl and Trotter for permutations
- Permutation classes and polyomino classes with excluded submatrices
This page was built for software: PermLab
