Joseph Naor, Moni Naor  Home/Search
Context Related
| wisdom.weizmann.ac.il/~nao...bias.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisdom.weizmann.ac.il/~na...onpub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show how to efficiently construct a small probability space on n binary random variables such that for every subset, its parity is either zero or one with "almost" equal probability. They are called ffl-biased random variables. The number of random bits needed to generate the random variables is O(log n + log 1 ffl ). Thus, if ffl is polynomially small, then the size of the sample space is also polynomial. Random variables that are ffl-biased can be used to construct "almost" k-wise... (Update)
Cited by: More
Preference Estimation and Query Learning - Blum, Jackson, al. (2004) (Correct)
Randomness versus Fault-Tolerance - Canetti, Kushilevitz, Ostrovsky.. (1999) (Correct)
On the Construction of Pseudo-Random Permutations.. - Naor, Reingold (1996) (Correct)
Active bibliography (related documents): More All
0.6: Dispersers, Deterministic Amplification, and Weak Random.. - Cohen, Wigderson (1989) (Correct)
0.5: Reducing Randomness In Computation Via Explicit Constructions - Zhou (1996) (Correct)
0.5: O(1) Probe Search - Amos Fiat Department (Correct)
Similar documents based on text: More All
0.2: CS37501-1 Randomized Algorithms Winter 2003 - Lecture January And (Correct)
0.1: Pseudo-Random Synthesizers, Functions and Permutations - Reingold (1998) (Correct)
0.1: Improved Algorithms via Approximations of Probability.. - Chari, Rohatgi.. (1997) (Correct)
Related documents from co-citation: More All
53: Simple constructions of almost k-wise independent random variables - Alon, Goldreich et al. - 1990
24: Approximations of general independent distributions - Even, Goldreich et al. - 1992
21: The Probabilistic Method (context) - Alon, Spencer - 1992
BibTeX entry: (Update)
J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput., 22(4):838--856, Aug. 1993. http://citeseer.ist.psu.edu/naor93smallbias.html More
@inproceedings{ naor90smallbias,
author = "Joseph Naor and Moni Naor",
title = "Small-bias Probability Spaces: Efficient Constructions and Applications",
booktitle = "{ACM} Symposium on Theory of Computing",
pages = "213-223",
year = "1990",
url = "citeseer.ist.psu.edu/naor93smallbias.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1991
1749 An Introduction to probability theory and its applications (context) - Feller - 1968
1529 A method for obtaining digital signatures and public key cry.. - Rivest, Shamir et al. - 1978
957 The probabilistic method (context) - Alon, Spencer - 1992
860 The theory of error correcting codes (context) - MacWilliams, Sloane - 1977
218 Probabilistic construction of deterministic algorithms: appr.. (context) - Raghavan - 1988
199 A simple parallel algorithm for the maximal independent set .. (context) - Luby - 1986
192 Designing programs that check their work - Blum, Kannan - 1987
139 Ten lectures on the probabilistic method (context) - Spencer - 1987
138 Small-bias probability spaces: efficient constructions and a.. - Naor, Naor - 1990
128 Simple constructions for almost k-wise independent random va.. - Alon, Goldreich et al. - 1992
102 A fast and simple randomized parallel algorithm for the maxi.. (context) - Alon, Babai et al. - 1986
96 Learning decision trees using the Fourier spectrum - Kushilevitz, Mansour - 1991
88 Deterministic simulation in LOGSPACE (context) - Ajtai, Komlos et al. - 1987
81 The bit extraction problem or t-resilient functions - Chor, Goldreich et al. - 1985
71 A fast parallel algorithm for the maximal independent set pr.. (context) - Karp, Wigderson - 1985
70 the power of two-point based sampling - Chor, Goldreich - 1989
58 Construction of Asymptotically Good Low-Rate Error-Correctin.. (context) - Alon, Bruck et al. - 1992
54 Checking the correctness of memories - Blum, Evans et al. - 1991
53 The probabilistic method yields deterministic parallel algor.. - Motwani, Naor et al. - 1989
44 A parallel algorithmic version of the local lemma (context) - Alon - 1991
42 wise independence in NC (context) - Berger, Rompel et al. - 1991
42 term DNF formulas with queries (context) - Blum, Rudich et al. - 1992
40 Approximation of general independent distributions - Even, Goldreich et al. - 1992
40 Explicit expanders and the Ramanujan conjecture (context) - Lubotzky, Phillips et al. - 1986
32 Hardness vs (context) - Nisan, Wigderson - 1988
30 adversaries and computation (context) - Vazirani - 1986
28 or time versus space (context) - Sipser, randomness - 1988
27 Amortized communication complexity - Feder, Kushilevitz et al. - 1991
23 Sample spaces uniform on neighborhoods (context) - Schulman - 1992
19 Explicit construction of linear size superconcentrators (context) - Gaber, Galil - 1981
19 Explicit constructions of exponential sized families of k-in.. (context) - Alon - 1986
18 Realistic analysis of some randomized algorithms (context) - Bach - 1987
17 Efficient parallel algorithms for edge coloring problems (context) - Karloff, Shmoys - 1987
15 A time randomness tradeoff (context) - Karp, Pippenger - 1983
12 Randomized algorithms and pseudorandom numbers (context) - Karloff, Raghavan - 1988
11 Deterministic simulation of probabilistic constant depth cir.. (context) - Ajtai, Wigderson - 1985
9 independent sets (context) - Kleitman, Spencer et al. - 1973
8 Expanders obtained from affine transformations (context) - Jimbo, Marouka - 1985
6 Vector sets for exhaustive testing of logic circuits (context) - Seroussi, Bshouti - 1988
5 Constructing Ramsey Graphs from Small Probability Spaces - Naor - 1992
5 the randomness complexity of algorithms (context) - Peralta
4 deterministic amplification and weak random sources (context) - Cohen, Wigderson - 1989
4 A class of asymptotically good algebraic codes (context) - Justesen - 1972
4 On using deterministic functions to reduce randomness in pro.. (context) - Santha - 1987
2 Multigraph Amplification (context) - Cohen, Wigderson - 1989
1 Springer Verlag Lecture Notes in CS (context) - Freivalds, algorithms - 1979
1 Recycling random bits (context) - Impagliazzo, Zuckerman - 1989
1 Hebrew University (context) - Ben-Nathan, Sc - 1990
1 Witnesses for matrix multiplication and for shortest paths (context) - Alon, Galil et al. - 1992
1 Naor Approximating arbitrary distributions using small sampl.. (context) - Azar, Motwani - 1990
1 IMS Lecture NotesMonograph Series (context) - Diaconis, in et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.wisdom.weizmann.ac.il/~naor/onpub.html): More
Deniable Encryption - Canetti, Dwork, Naor, Ostrovsky (1996) (Correct)
Certificate Revocation and Certificate Update - Naor, Nissim (1998) (Correct)
Verification of a human in the loop or Identification via the.. - Naor (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC