Parallel Weighted Random Sampling
From MaRDI portal
Publication:5075804
Recommendations
Cites work
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 176751 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 839542 (Why is no real title available?)
- A general purpose unequal probability sampling plan
- Algorithms and Data Structures
- An Efficient Method for Generating Discrete Random Variables with General Distributions
- An Efficient Method for Weighted Sampling without Replacement
- Dynamic generation of discrete random variates
- Efficient parallel random sampling-vectorized, cache-efficient, and online
- Efficient sampling methods for discrete distributions
- Engineering Algorithms for Approximate Weighted Matching
- How to emulate shared memory
- Maintaining discrete probability distributions optimally
- Mersenne twister
- On the Amount of Dependence in the Prime Factorization of a Uniform Random Integer
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- Parallel Merge Sort
- Practical algorithms for generating a random ordering of the elements of a weighted set
- Random permutations on distributed, external and hierarchical memory
- Sequential random sampling
- Succinct sampling from discrete distributions
- Weighted random sampling with a reservoir
Cited in
(4)
This page was built for publication: Parallel Weighted Random Sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075804)