Parallel Weighted Random Sampling
From MaRDI portal
Publication:5075804
DOI10.4230/LIPICS.ESA.2019.59OpenAlexW2977810879MaRDI QIDQ5075804FDOQ5075804
Authors: Lorenz Hübschle-Schneider, Peter Sanders 
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1903.00227
Recommendations
parallel algorithmPRAMalias methodreservoir samplingcategorical distributionsubset samplingcommunication efficient algorithmmultinoulli distribution
Cites Work
- Mersenne twister
- Title not available (Why is that?)
- Dynamic generation of discrete random variates
- Efficient sampling methods for discrete distributions
- Succinct sampling from discrete distributions
- Weighted random sampling with a reservoir
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random permutations on distributed, external and hierarchical memory
- Parallel Merge Sort
- Title not available (Why is that?)
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- Title not available (Why is that?)
- How to emulate shared memory
- An Efficient Method for Generating Discrete Random Variables with General Distributions
- Algorithms and Data Structures
- Maintaining discrete probability distributions optimally
- An Efficient Method for Weighted Sampling without Replacement
- Practical algorithms for generating a random ordering of the elements of a weighted set
- A general purpose unequal probability sampling plan
- On the Amount of Dependence in the Prime Factorization of a Uniform Random Integer
- Engineering Algorithms for Approximate Weighted Matching
- Efficient parallel random sampling-vectorized, cache-efficient, and online
- Sequential random sampling
Cited In (4)
Uses Software
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)
