1 paper · 1 filter
Peter Kagey
We discuss efficient methods for unranking derangements and ménage permutations. That is, we will provide an algorithm to efficiently extract the k-th earliest such permutation u…