An improved deterministic algorithm for generating different many-element random samples

Amihood Amir, Emanuel Dar

Research output: Contribution to journalArticlepeer-review


We consider the problem of deterministically selecting s uniformly random different m-element subsets of {1 , . . . , k}. The only known lower bound for the time to solve this problem is the trivial Ω(sm). The best two previously known solutions are of time O(sm3 log m log log m) and O(s(k + m)), respectively. In this paper we present an algorithm whose time complexity is O(s2m2 + sm2 log m log log m + sm log sm). Thus, for s < m log m log log m this algorithm is the fastest known deterministic algorithm. The main idea of the algorithm is using a uniform random number generator to efficiently construct biased random numbers.

Original languageEnglish
Pages (from-to)95-101
Number of pages7
JournalInformation Processing Letters
Issue number2
StatePublished - 28 Apr 1997

Bibliographical note

Funding Information:
* Corresponding author. Email: Partially sup-port by NSF grant CCR-92-23699 and Israel Ministry of Science and Arts grant 6297. ’ Email:


  • Algorithms
  • Biased number generation
  • Random sampling
  • Random set generation


Dive into the research topics of 'An improved deterministic algorithm for generating different many-element random samples'. Together they form a unique fingerprint.

Cite this