Generating Random Derangements
From MaRDI portal
Publication:5194649
DOI10.1137/1.9781611972986.7zbMath1429.68160OpenAlexW2247405518MaRDI QIDQ5194649
Conrado Martínez, Prodinger, Helmut, Alois Panholzer
Publication date: 16 September 2019
Published in: 2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611972986.7
Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)
Related Items (6)
The Feller coupling for random derangements ⋮ Runtime analysis for permutation-based evolutionary algorithms ⋮ Efficient generation of random derangements with the expected distribution of cycle lengths ⋮ Unnamed Item ⋮ Preserving the number of cycles of length \(k\) in a growing uniform permutation ⋮ Efficient linear-time ranking and unranking of derangements
This page was built for publication: Generating Random Derangements
