Abstract
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(sm 3 log m log log m) and O(s(k+m)), respectivly. In this paper we present an algorithm whose time comlexity is O(s 2 m 2+sm 2 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 language | English |
|---|---|
| Title of host publication | Algorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings |
| Editors | Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Di Battista |
| Publisher | Springer Verlag |
| Pages | 159-170 |
| Number of pages | 12 |
| ISBN (Print) | 3540625925, 9783540625926 |
| DOIs | |
| State | Published - 1997 |
| Event | 3rd Italian Conference on Algorithms and Complexity, CIAC 1997 - Rome, Italy Duration: 12 Mar 1997 → 14 Mar 1997 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1203 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 3rd Italian Conference on Algorithms and Complexity, CIAC 1997 |
|---|---|
| Country/Territory | Italy |
| City | Rome |
| Period | 12/03/97 → 14/03/97 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1997.
Fingerprint
Dive into the research topics of 'An improved deterministic algorithm for generalized random sampling'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver