An efficient algorithm for random sampling without replacement

DOI10.1080/00207168408803438zbMath0554.65100OpenAlexW2004793788MaRDI QIDQ3217576

G. P. Bhattacharjee, P. Gupta

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 algorithmstime complexityspace complexityrandom samplerandom sampling without replacement

Mathematics Subject Classification ID

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

Related Items (2)

Motif estimation via subgraph sampling: the fourth-moment phenomenon ⋮ An efficient parallel algorithm for random sampling

Cites Work

• Parallel Generation of Permutations

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