Approximations of general independent distributions

Guy Even; Oded Goldreicht; Michael Luby; Noam Nisan; Boban Velickovic

doi:10.1145/129712.129714

Approximations of general independent distributions

Guy Even, Oded Goldreicht, Michael Luby, Noam Nisan, Boban Velickovic

The Rachel and Selim Benin School of Engineering and Computer Science

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

58 Scopus citations

Abstract

We describe efficient constructions of small probability spaces that approximate the independent distribution for general random variables. Previous work on efficient constructions concentrate on approximations of the independent distribution for the special case of uniform boolean-valued random variables. Our results yield efficient constructions of small sets with low discrepancy in high dimensional space and have applications to de-randomizing randomized algorithms.

Original language	American English
Title of host publication	Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992
Publisher	Association for Computing Machinery
Pages	10-16
Number of pages	7
ISBN (Electronic)	0897915119
DOIs	https://doi.org/10.1145/129712.129714
State	Published - 1 Jul 1992
Event	24th Annual ACM Symposium on Theory of Computing, STOC 1992 - Victoria, Canada Duration: 4 May 1992 → 6 May 1992

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
Volume	Part F129722
ISSN (Print)	0737-8017

Conference

Conference	24th Annual ACM Symposium on Theory of Computing, STOC 1992
Country/Territory	Canada
City	Victoria
Period	4/05/92 → 6/05/92

Bibliographical note

Funding Information:
search partially supported by grant No. S9-00312 from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel. $Intemationaf Computer Science Institute, 1947 Center Street, Berkeley, Cfllfomia 947o4, research partially supported by NSF operating grant CCR-9016468 and by grant No. 89-00312 from the United States-Israel Binationaf Science Foundation (BSF), Jerusalem, Israel. $Department of Computer Science, Hebrew University, Jerusalem, Israel, Supported by the Wolfson researeh awards administered by the Israeli Academy of Sciences and Humanities and by USA-Israel BSF S9-00126 f Department of Mathematics, supported by NSF Permission to copy without fee ell or part of this material is granted provided that the copias are not made or distributed for direct commercial advantage, the ACM copyright notica and tha title of the publication and its date appear, and notica is givan that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a faa and/or specific permission. 24th ANNUAL ACM STOC - 5/92/VICTORIA, B.C., CANADA @1992 ACM 0.89791-51 2-7\92/0004/OOJ O...$J .50

Publisher Copyright:
© 1992 ACM.

Access to Document

10.1145/129712.129714

Cite this

Even, G., Goldreicht, O., Luby, M., Nisan, N., & Velickovic, B. (1992). Approximations of general independent distributions. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992 (pp. 10-16). (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129722). Association for Computing Machinery. https://doi.org/10.1145/129712.129714

@inproceedings{709a6883801545ea83c51cfc9c91da3c,

title = "Approximations of general independent distributions",

abstract = "We describe efficient constructions of small probability spaces that approximate the independent distribution for general random variables. Previous work on efficient constructions concentrate on approximations of the independent distribution for the special case of uniform boolean-valued random variables. Our results yield efficient constructions of small sets with low discrepancy in high dimensional space and have applications to de-randomizing randomized algorithms.",

author = "Guy Even and Oded Goldreicht and Michael Luby and Noam Nisan and Boban Velickovic",

note = "Funding Information: search partially supported by grant No. S9-00312 from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel. $Intemationaf Computer Science Institute, 1947 Center Street, Berkeley, Cfllfomia 947o4, research partially supported by NSF operating grant CCR-9016468 and by grant No. 89-00312 from the United States-Israel Binationaf Science Foundation (BSF), Jerusalem, Israel. $Department of Computer Science, Hebrew University, Jerusalem, Israel, Supported by the Wolfson researeh awards administered by the Israeli Academy of Sciences and Humanities and by USA-Israel BSF S9-00126 f Department of Mathematics, supported by NSF Permission to copy without fee ell or part of this material is granted provided that the copias are not made or distributed for direct commercial advantage, the ACM copyright notica and tha title of the publication and its date appear, and notica is givan that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a faa and/or specific permission. 24th ANNUAL ACM STOC - 5/92/VICTORIA, B.C., CANADA @1992 ACM 0.89791-51 2-7\92/0004/OOJ O...$J .50 Publisher Copyright: {\textcopyright} 1992 ACM.; 24th Annual ACM Symposium on Theory of Computing, STOC 1992 ; Conference date: 04-05-1992 Through 06-05-1992",

year = "1992",

month = jul,

day = "1",

doi = "10.1145/129712.129714",

language = "American English",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "10--16",

booktitle = "Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992",

}

Even, G, Goldreicht, O, Luby, M, Nisan, N & Velickovic, B 1992, Approximations of general independent distributions. in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F129722, Association for Computing Machinery, pp. 10-16, 24th Annual ACM Symposium on Theory of Computing, STOC 1992, Victoria, Canada, 4/05/92. https://doi.org/10.1145/129712.129714

Approximations of general independent distributions. / Even, Guy; Goldreicht, Oded; Luby, Michael et al.
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992. Association for Computing Machinery, 1992. p. 10-16 (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129722).

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

TY - GEN

T1 - Approximations of general independent distributions

AU - Even, Guy

AU - Goldreicht, Oded

AU - Luby, Michael

AU - Nisan, Noam

AU - Velickovic, Boban

N1 - Funding Information: search partially supported by grant No. S9-00312 from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel. $Intemationaf Computer Science Institute, 1947 Center Street, Berkeley, Cfllfomia 947o4, research partially supported by NSF operating grant CCR-9016468 and by grant No. 89-00312 from the United States-Israel Binationaf Science Foundation (BSF), Jerusalem, Israel. $Department of Computer Science, Hebrew University, Jerusalem, Israel, Supported by the Wolfson researeh awards administered by the Israeli Academy of Sciences and Humanities and by USA-Israel BSF S9-00126 f Department of Mathematics, supported by NSF Permission to copy without fee ell or part of this material is granted provided that the copias are not made or distributed for direct commercial advantage, the ACM copyright notica and tha title of the publication and its date appear, and notica is givan that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a faa and/or specific permission. 24th ANNUAL ACM STOC - 5/92/VICTORIA, B.C., CANADA @1992 ACM 0.89791-51 2-7\92/0004/OOJ O...$J .50 Publisher Copyright: © 1992 ACM.

PY - 1992/7/1

Y1 - 1992/7/1

N2 - We describe efficient constructions of small probability spaces that approximate the independent distribution for general random variables. Previous work on efficient constructions concentrate on approximations of the independent distribution for the special case of uniform boolean-valued random variables. Our results yield efficient constructions of small sets with low discrepancy in high dimensional space and have applications to de-randomizing randomized algorithms.

AB - We describe efficient constructions of small probability spaces that approximate the independent distribution for general random variables. Previous work on efficient constructions concentrate on approximations of the independent distribution for the special case of uniform boolean-valued random variables. Our results yield efficient constructions of small sets with low discrepancy in high dimensional space and have applications to de-randomizing randomized algorithms.

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

U2 - 10.1145/129712.129714

DO - 10.1145/129712.129714

M3 - Conference contribution

AN - SCOPUS:0027004045

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 10

EP - 16

BT - Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992

PB - Association for Computing Machinery

T2 - 24th Annual ACM Symposium on Theory of Computing, STOC 1992

Y2 - 4 May 1992 through 6 May 1992

ER -

Approximations of general independent distributions

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this