Faster methods for random sampling
From MaRDI portal
Publication:3727227
DOI10.1145/358105.893zbMath0595.65008OpenAlexW2002722920MaRDI QIDQ3727227
Publication date: 1984
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/358105.893
Related Items
Shortest paths in Euclidean graphs, An efficient parallel algorithm for random sampling, A stratified reservoir sampling algorithm in streams and large datasets, Computer generated simple random samples, FastSIR algorithm: a fast algorithm for the simulation of the epidemic spread in large networks by using the susceptible-infected-recovered compartment model, Boosting distinct random sampling for basic counting on the union of distributed streams, Sampling in space restricted settings, Markov chain Monte Carlo sampling using a reservoir method, Weighted random sampling with a reservoir
