Efficient sampling of random permutations
DOI10.1016/J.JDA.2006.11.002zbMATH Open1152.68056OpenAlexW1969420048MaRDI QIDQ954966FDOQ954966
Authors: 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
Recommendations
- Random permutations on distributed, external and hierarchical memory
- scientific article; zbMATH DE number 176751
- Delayed path coupling and generating random permutations
- Efficient parallel random sampling-vectorized, cache-efficient, and online
- Fast generation of random permutations via networks simulation
random permutationsexternal memory algorithmsrandom shufflingcoarse grained parallelismuniformly generated communication matrix
Permutations, words, matrices (05A05) Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- Efficient external memory algorithms by simulating coarse-grained parallel algorithms
- Title not available (Why is that?)
- A complexity theory of efficient parallel algorithms
- The patchwork rejection technique for sampling from unimodal distributions
- Fast generation of random permutations via networks simulation
- Generating beta variates via patchwork rejection
- Comment on ‘Monitoring, Implicit Contracting, and the Lack of Permanence of Leveraged Buyouts’
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Generation of the symmetric group \(S_{n^2}\)
- A uniform sampling method for permutation space
- Using Rademacher permutations to reduce randomness
- Optimal sampling strategies in Quicksort and Quickselect
- Efficient parallel random sampling-vectorized, cache-efficient, and online
- Title not available (Why is that?)
- On the randomness complexity of efficient sampling
Uses Software
This page was built for publication: Efficient sampling of random permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954966)