Random permutations on distributed, external and hierarchical memory
From MaRDI portal
(Redirected from Publication:293386)
Recommendations
Cites work
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- Efficient external memory algorithms by simulating coarse-grained parallel algorithms
- Fast generation of random permutations via networks simulation
- One-by-one cleaning for practical parallel list ranking
- Randomized multipacket routing and sorting on meshes
- Towards optimal locality in mesh-indexings
Cited in
(12)- Efficient sampling of random permutations
- scientific article; zbMATH DE number 176751 (Why is no real title available?)
- scientific article; zbMATH DE number 1863285 (Why is no real title available?)
- Fast random integer generation in an interval
- Fast generation of random permutations via networks simulation
- I/O-efficient generation of massive graphs following the \textit{LFR} benchmark
- Algorithm 947: Paraperm -- parallel generation of random permutations with MPI
- The generation of random permutations on the fly
- In-place random list permutations
- Parallel Weighted Random Sampling
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- MergeShuffle: a very fast, parallel random permutation algorithm
This page was built for publication: Random permutations on distributed, external and hierarchical memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293386)