Parallel Weighted Random Sampling
From MaRDI portal
Publication:5075804
DOI10.4230/LIPIcs.ESA.2019.59OpenAlexW2977810879MaRDI QIDQ5075804
Lorenz Hübschle-Schneider, Peter Sanders
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1903.00227
parallel algorithmPRAMalias methodreservoir samplingcategorical distributionsubset samplingcommunication efficient algorithmmultinoulli distribution
Related Items (2)
Remarks on some misconceptions about unequal probability sampling without replacement ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random permutations on distributed, external and hierarchical memory
- Practical algorithms for generating a random ordering of the elements of a weighted set
- How to emulate shared memory
- Weighted random sampling with a reservoir
- Dynamic generation of discrete random variates
- Efficient sampling methods for discrete distributions
- An Efficient Method for Generating Discrete Random Variables with General Distributions
- A general purpose unequal probability sampling plan
- Sequential random sampling
- Parallel Merge Sort
- An Efficient Method for Weighted Sampling without Replacement
- Mersenne twister
- On the Amount of Dependence in the Prime Factorization of a Uniform Random Integer
- Efficient Parallel Random Sampling—Vectorized, Cache-Efficient, and Online
- Maintaining discrete probability distributions optimally
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- Engineering Algorithms for Approximate Weighted Matching
- Succinct sampling from discrete distributions
- Algorithms and Data Structures
This page was built for publication: Parallel Weighted Random Sampling
