Sequential random sampling

DOI10.1145/214392.214402MaRDI QIDQ3692682zbMATH OpenOpenAlexFDO

Authors Joachim H. Ahrens, Ulrich Dieter

Publication date 1985

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toms/1985-11/

zbMATH Keywords

geometric distributionhash techniquesrandom samplingsequential random selection

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Recommendations

• Faster methods for random sampling
• Random sampling with a reservoir
• scientific article; zbMATH DE number 4163904
• An efficient algorithm for random sampling without replacement
• Reservoir-sampling algorithms of time complexity O ( n (1 + log( N / n )))

Cited in

(10)

• scientific article; zbMATH DE number 4163904 (Why is no real title available?)
• Random sampling with a reservoir
• Faster methods for random sampling
• Reservoir-sampling algorithms of time complexity O ( n (1 + log( N / n )))
• Random Sampling
• scientific article; zbMATH DE number 1857637 (Why is no real title available?)
• Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
• Parallel Weighted Random Sampling
• Sequential Method of Sampling for Deciding Between Two Courses of Action
• Fiat-Shamir transformation of multi-round interactive proofs (Extended version)

This page was built for publication: Sequential random sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3692682)