An efficient algorithm for random sampling without replacement

DOI10.1080/00207168408803438MaRDI QIDQ3217576zbMATH OpenOpenAlexFDO

Authors P. Gupta, G. P. Bhattacharjee

Publication date 1984

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168408803438

zbMATH Keywords

analysis of algorithmsspace complexitytime complexityrandom samplerandom sampling without replacement

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99) Sampling theory, sample surveys (62D05) Algorithms in computer science (68W99)

Recommendations

• Faster methods for random sampling
• Random sampling with a reservoir
• scientific article; zbMATH DE number 4163904
• Reservoir-sampling algorithms of time complexity O ( n (1 + log( N / n )))
• One-Pass Selection of a Sample with Probability Proportional to Size

Cites work

• Parallel Generation of Permutations

Cited in

(9)

• Weighted random sampling with a reservoir
• An improved deterministic algorithm for generating different many-element random samples
• Motif estimation via subgraph sampling: the fourth-moment phenomenon
• Sequential random sampling
• Faster methods for random sampling
• An efficient parallel algorithm for random sampling
• scientific article; zbMATH DE number 4163904 (Why is no real title available?)
• A fast algorithm for balanced sampling
• Heterogeneous subset sampling

This page was built for publication: An efficient algorithm for random sampling without replacement

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