A CAT algorithm for generating permutations with a fixed number of inversions
From MaRDI portal
(Redirected from Publication:1007583)
Cites work
- scientific article; zbMATH DE number 434868 (Why is no real title available?)
- scientific article; zbMATH DE number 1506516 (Why is no real title available?)
- A new algorithm for generating derangements
- An asymptotic expansion for the number of permutations with a certain number of inversions
- Generating Linear Extensions Fast
- Generating alternating permutations lexicographically
- Linear probing and graphs
- Permutations with inversions
Cited in
(11)- An efficient Gray code algorithm for generating all permutations with a given major index
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
- Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
- Restricted compositions and permutations: from old to new Gray codes
- Algorithmic combinatorics based on slicing posets
- Gray code for derangements
- Gray code for permutations with a fixed number of cycles
- Generating restricted classes of involutions, Bell and Stirling permutations
- More restrictive Gray codes for some classes of pattern avoiding permutations
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
This page was built for publication: A CAT algorithm for generating permutations with a fixed number of inversions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007583)
