An Algorithm for Unbiased Random Sampling

  title={An Algorithm for Unbiased Random Sampling},
  author={Jarmo Ernvall and Olli Nevalainen},
  journal={Comput. J.},
The problem of random sampling occurs in many different contexts. For example, we may wish to study experimentally the behaviour of a new data structure for searching. Then the easiest way is to generate a set of data elements, construct the corresponding structure and then perform searching of some elements belonging (or not belonging) to the data structure. A usual approach is to use a set of data elements where the elements are randomly sampled from a universal set. If we allow multiple… CONTINUE READING


Publications referenced by this paper.

Introduction to the Design and Analysis of Algorithms

S. Goodman, S. Hedetniemi

Similar Papers

Loading similar papers…