Pages that link to "Item:Q4600719"
From MaRDI portal
The following pages link to Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations (Q4600719):
Displaying 8 items.
- Refining enumeration schemes to count according to permutation statistics (Q405263) (← links)
- Classical length-5 pattern-avoiding permutations (Q2161199) (← links)
- Catalan intervals and uniquely sorted permutations (Q2174949) (← links)
- Exhaustive generation for permutations avoiding (colored) regular sets of patterns (Q2274076) (← links)
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations (Q4600719) (← links)
- Automatic discovery of structural rules of permutation classes (Q4629385) (← links)
- Fast Sorting and Pattern-Avoiding Permutations (Q5194608) (← links)
- Finding and Counting Permutations via CSPs (Q5875533) (← links)