scientific article; zbMATH DE number 176751
From MaRDI portal
Publication:4036581
Recommendations
- Fast generation of random permutations via networks simulation
- Fast generation of random permutations via networks simulation
- Efficient low-contention parallel algorithms
- Random permutations on distributed, external and hierarchical memory
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
Cited in
(25)- Efficient sampling of random permutations
- Fast generation of random permutations via networks simulation
- In-place random list permutations
- The generation of random permutations on the fly
- The log-star revolution
- Fine-grained secure computation
- Random permutations on distributed, external and hierarchical memory
- Randomization helps to perform independent tasks reliably
- Applying fast simulation to find the number of good permutations
- Generating combinations in parallel
- Parallel generation of permutations and combinations
- The parallel complexity of growth models
- Sampling lower bounds: Boolean average-case and permutations
- scientific article; zbMATH DE number 1863285 (Why is no real title available?)
- 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
- On a compaction theorem of Ragde
- Randomized range-maxima in nearly-constant parallel time
- Sequential random permutation, list contraction and tree contraction are highly parallel
- A parallel derangement generation algorithm
- Fast and optimal simulations between CRCW PRAMs
- Parallel Weighted Random Sampling
- Algorithm 947: Paraperm -- parallel generation of random permutations with MPI
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036581)
