Delayed path coupling and generating random permutations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 837692 (Why is no real title available?)
- scientific article; zbMATH DE number 871941 (Why is no real title available?)
- A more rapidly mixing Markov chain for graph colorings
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
- Efficient low-contention parallel algorithms
- Fast generation of random permutations via networks simulation
- Generating a random permutation with random transpositions
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- Riffle shuffles, cycles, and descents
- Shuffling Cards and Stopping Times
- The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
Cited in
(6)- Efficient sampling of random permutations
- Reverse cycle walking and its applications
- scientific article; zbMATH DE number 1305416 (Why is no real title available?)
- Targeted ciphers for format-preserving encryption
- Provable unlinkability against traffic analysis with low message overhead
- Physical expander in virtual tree overlay
This page was built for publication: Delayed path coupling and generating random permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521548)