Delayed path coupling and generating random permutations

DOI<238::AID-RSA4>3.0.CO;2-E 10.1002/1098-2418(200010/12)17:3/4<238::AID-RSA4>3.0.CO;2-EzbMath0967.68015MaRDI QIDQ4521548

Mirosław Kutyłowski, Artur Czumaj

Publication date: 19 December 2000

Full work available at URL: https://doi.org/10.1002/1098-2418(200010/12)17:3/4<238::aid-rsa4>3.0.co;2-e

zbMATH Keywords

delayed path coupling; distributed mixing

Mathematics Subject Classification ID

68M14: Distributed systems

Related Items

Targeted ciphers for format-preserving encryption, Provable unlinkability against traffic analysis with low message overhead, Reverse Cycle Walking and Its Applications, Physical Expander in Virtual Tree Overlay

Cites Work

• Efficient low-contention parallel algorithms
• Fast generation of random permutations via networks simulation
• Riffle shuffles, cycles, and descents
• Shuffling Cards and Stopping Times
• Generating a random permutation with random transpositions
• The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
• A more rapidly mixing Markov chain for graph colorings
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
• Unnamed Item
• Unnamed Item