The following pages link to Generating Random Derangements (Q5194649):
Displaying 5 items.
- Preserving the number of cycles of length \(k\) in a growing uniform permutation (Q727199) (← links)
- Efficient linear-time ranking and unranking of derangements (Q2094363) (← links)
- The Feller coupling for random derangements (Q2145822) (← links)
- Efficient generation of random derangements with the expected distribution of cycle lengths (Q2204174) (← links)
- Runtime analysis for permutation-based evolutionary algorithms (Q6185938) (← links)