An efficient algorithm for generalized random sampling

Amihood Amir, Doron Mintz

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


An efficient algorithm for selecting s different m-element subsets of {1, ..., k} is presented. The lower bound for this problem is Ω(sm). The two previously known solutions are of time complexity O(sm2 log k) and O(s(k + m)). Our method is ranking the lexicographic order of m-tuples and then generating an s-element random sample. The time complexity is O(sm2).

Original languageEnglish
Pages (from-to)683-686
Number of pages4
JournalPattern Recognition Letters
Issue number11
StatePublished - Nov 1991
Externally publishedYes

Bibliographical note

Funding Information:
* Partially supported by NSF grant CCR-880364 and a University of Maryland General Research Board Full Year Award. ** The support of NSF grant DCR-86-03723 is gratefully acknowledged.


Dive into the research topics of 'An efficient algorithm for generalized random sampling'. Together they form a unique fingerprint.

Cite this