Abstract

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.

You do not currently have access to this article.