Jarmo Ernvall, Olli Nevalainen; An Algorithm for Unbiased Random Sampling. Comput J 1982; 25 (1): 45-47. doi: 10.1093/comjnl/25.1.45
Download citation file:
© 2017 Oxford University Press
An algorithm for selection of an unbiased sample out of a set of possible elements without replacement is given. The storage space depends linearly on the sample size; also the running time of the algorithm is low.
Most users should sign in with their email address. If you originally registered with a username please use that to sign in.
To purchase short term access, please sign in to your Oxford Academic account above.
Don't already have an Oxford Academic account? Register
Oxford University Press is a department of the University of Oxford. It furthers the University's objective of excellence in research, scholarship, and education by publishing worldwide
Sign In or Create an Account
This PDF is available to Subscribers Only
For full access to this pdf, sign in to an existing account, or purchase an annual subscription.