Generating Random Permutations by Coin Tossing

DOI10.1145/3009909zbMath1445.68104OpenAlexW2587429114MaRDI QIDQ4962656

Tsung-Hsi Tsai, Hsien-Kuei Hwang, Olivier Bodini, Axel Bacher

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3009909

zbMATH Keywords

Mellin transformgenerating functionsasymptotic distributionanalysis of algorithmsvarianceuniform distributionrandom permutationrandom number generatormultithreadinghardware random number generator

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Combinatorial probability (60C05) Random number generation in numerical analysis (65C10)

Related Items (6)

Generation of the symmetric group Sn2 ⋮ Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study ⋮ Unicyclic strong permutations ⋮ Efficient generation of random derangements with the expected distribution of cycle lengths ⋮ ON BINARY SOLUTIONS TO SYSTEMS OF EQUATIONS ⋮ Dependence between path-length and size in random digital trees

Uses Software

• DRNG
• Paraperm

This page was built for publication: Generating Random Permutations by Coin Tossing