Pages that link to "Item:Q1007583"
From MaRDI portal
The following pages link to A CAT algorithm for generating permutations with a fixed number of inversions (Q1007583):
Displaying 11 items.
- Gray code for permutations with a fixed number of cycles (Q879329) (← links)
- Generating restricted classes of involutions, Bell and Stirling permutations (Q966165) (← links)
- More restrictive Gray codes for some classes of pattern avoiding permutations (Q989488) (← links)
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns (Q1736650) (← links)
- Gray code for derangements (Q1827847) (← links)
- Restricted compositions and permutations: from old to new Gray codes (Q1944104) (← links)
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
- An efficient Gray code algorithm for generating all permutations with a given major index (Q2447540) (← links)
- Algorithmic combinatorics based on slicing posets (Q2503297) (← links)
- Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (Q2958342) (← links)
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (Q4632217) (← links)
