Fast generation of random permutations via networks simulation
From MaRDI portal
Recommendations
- Fast generation of random permutations via networks simulation
- Random permutations using switching networks
- scientific article; zbMATH DE number 176751
- A fast parallel algorithm for routing in permutation networks
- The generation of random permutations on the fly
- Generating pseudo-random permutations and maximum flow algorithms
- Generating Random Networks and Graphs
- An efficient generator for clustered dynamic random networks
- On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks
- On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks
Cited in
(10)- Efficient sampling of random permutations
- In-place random list permutations
- Deterministic encryption with the Thorp shuffle
- scientific article; zbMATH DE number 176751 (Why is no real title available?)
- Applying fast simulation to find the number of good permutations
- Fast generation of random permutations via networks simulation
- MergeShuffle: a very fast, parallel random permutation algorithm
- Delayed path coupling and generating random permutations
- Generating random permutations by coin tossing: classical algorithms, new analysis, and modern implementation
- Algorithm 947: Paraperm -- parallel generation of random permutations with MPI
This page was built for publication: Fast generation of random permutations via networks simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386457)
