An improved deterministic algorithm for generalized random sampling

Amihood Amir; Emanuel Dar

doi:10.1007/3-540-62592-5_69

An improved deterministic algorithm for generalized random sampling

Amihood Amir, Emanuel Dar

Department of Mathematics

Bar-Ilan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 ³ log m log log m) and O(s(k+m)), respectivly. In this paper we present an algorithm whose time comlexity is O(s ² m ²+sm ² 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	https://doi.org/10.1007/3-540-62592-5_69
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.

Access to Document

10.1007/3-540-62592-5_69

Cite this

Amir, A., & Dar, E. (1997). An improved deterministic algorithm for generalized random sampling. In G. Bongiovanni, D. P. Bovet, & G. Di Battista (Eds.), Algorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings (pp. 159-170). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1203). Springer Verlag. https://doi.org/10.1007/3-540-62592-5_69

Amir, Amihood ; Dar, Emanuel. / An improved deterministic algorithm for generalized random sampling. Algorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings. editor / Giancarlo Bongiovanni ; Daniel Pierre Bovet ; Giuseppe Di Battista. Springer Verlag, 1997. pp. 159-170 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{df831c137f424c1890aa1f73d2a486be,

title = "An improved deterministic algorithm for generalized random sampling",

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",

author = "Amihood Amir and Emanuel Dar",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 3rd Italian Conference on Algorithms and Complexity, CIAC 1997 ; Conference date: 12-03-1997 Through 14-03-1997",

year = "1997",

doi = "10.1007/3-540-62592-5_69",

language = "אנגלית",

isbn = "3540625925",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "159--170",

editor = "Giancarlo Bongiovanni and Bovet, {Daniel Pierre} and {Di Battista}, Giuseppe",

booktitle = "Algorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings",

address = "גרמניה",

}

Amir, A & Dar, E 1997, An improved deterministic algorithm for generalized random sampling. in G Bongiovanni, DP Bovet & G Di Battista (eds), Algorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1203, Springer Verlag, pp. 159-170, 3rd Italian Conference on Algorithms and Complexity, CIAC 1997, Rome, Italy, 12/03/97. https://doi.org/10.1007/3-540-62592-5_69

An improved deterministic algorithm for generalized random sampling. / Amir, Amihood; Dar, Emanuel.
Algorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings. ed. / Giancarlo Bongiovanni; Daniel Pierre Bovet; Giuseppe Di Battista. Springer Verlag, 1997. p. 159-170 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1203).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An improved deterministic algorithm for generalized random sampling

AU - Amir, Amihood

AU - Dar, Emanuel

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1997.

PY - 1997

Y1 - 1997

N2 - 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

AB - 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

UR - http://www.scopus.com/inward/record.url?scp=84957622763&partnerID=8YFLogxK

U2 - 10.1007/3-540-62592-5_69

DO - 10.1007/3-540-62592-5_69

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84957622763

SN - 3540625925

SN - 9783540625926

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 159

EP - 170

BT - Algorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings

A2 - Bongiovanni, Giancarlo

A2 - Bovet, Daniel Pierre

A2 - Di Battista, Giuseppe

PB - Springer Verlag

T2 - 3rd Italian Conference on Algorithms and Complexity, CIAC 1997

Y2 - 12 March 1997 through 14 March 1997

ER -

Amir A, Dar E. An improved deterministic algorithm for generalized random sampling. In Bongiovanni G, Bovet DP, Di Battista G, editors, Algorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings. Springer Verlag. 1997. p. 159-170. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-62592-5_69

An improved deterministic algorithm for generalized random sampling

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this