The following pages link to (Q3332267):
Displaying 7 items.
- A multi-stack method for the fast generation of permutations with minimal length increasing subsequences (Q294635) (← links)
- Efficient enumeration of ordered trees with \(k\) leaves (Q441889) (← links)
- Generating permutations with given ups and downs (Q1186163) (← links)
- Generating permutations of a bag by interchanges (Q1197979) (← links)
- Finding parity difference by involutions (Q1356534) (← links)
- On generating \(k\)-ary trees in computer representation (Q1603407) (← links)
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) (Q3605493) (← links)
