Efficient sampling of random permutations

DOI10.1016/J.JDA.2006.11.002zbMath1152.68056OpenAlexW1969420048MaRDI QIDQ954966

Jens Gustedt

Publication date: 18 November 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.11.002

zbMATH Keywords

external memory algorithmsrandom permutationsrandom shufflingcoarse grained parallelismuniformly generated communication matrix

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Permutations, words, matrices (05A05) Parallel algorithms in computer science (68W10)

Related Items (1)

Generation of the symmetric group Sn2

Uses Software

• parXXL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complexity theory of efficient parallel algorithms
• Fast generation of random permutations via networks simulation
• Efficient external memory algorithms by simulating coarse-grained parallel algorithms
• Generating beta variates via patchwork rejection
• Comment on ‘Monitoring, Implicit Contracting, and the Lack of Permanence of Leveraged Buyouts’
• The patchwork rejection technique for sampling from unimodal distributions

This page was built for publication: Efficient sampling of random permutations