Aravind Srinivasan, David Zuckerman  Home/Search
Context Related
| utexas.edu/users/diz/subconstant.ps 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: utexas.edu/users/diz/pubs (more) Homepages: A.Srinivasan |
Rate this article:      (best)Comment on this article |
Abstract: . We give an efficient algorithm to extract randomness from a very weak random source using a small additional number t of truly random bits. Our work extends that of Nisan & Zuckerman in that t remains small even if the entropy rate is well below constant. A key application of this is in running randomized algorithms using such a very weak source of randomness. For any fixed fl ? 0, we show how to simulate RP algorithms in time n O(log n) using the output of a ffi-source with minentropy R fl . ... (Update)
Cited by: More
Simpler Session-Key Generation from Short Random Passwords - Salil (2004) (Correct)
Loss-less Condensers, Unbalanced Expanders, and Extractors - Ta-Shma, Umans, Zuckerman (Correct)
Bounds For Dispersers, Extractors, And Depth-Two - Superconcentrators Jaikumar.. (Correct)
Active bibliography (related documents): More All
0.9: Explicit OR-Dispersers with Polylogarithmic Degree - Saks, Srinivasan, Zhou (1998) (Correct)
0.7: Simulating BPP Using a General Weak Random Source - Zuckerman (1995) (Correct)
0.6: Reducing Randomness In Computation Via Explicit Constructions - Zhou (1996) (Correct)
Similar documents based on text: More All
0.2: Complexity Classes Characterized by Semi-Random Sources - Uehara (1995) (Correct)
0.2: Constructions of Near-Optimal Extractors Using Pseudo-Random.. - Trevisan (1998) (Correct)
0.2: Another proof that BPP \subseteq PH (and more) - Goldreich, Zuckerman (1997) (Correct)
Related documents from co-citation: More All
41: Simulating BPP Using a General Weak Random Source - Zuckerman - 1991
37: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Co.. - Chor, Goldreich - 1988
35: Randomness is Linear in Space - Nisan, Zuckerman - 1993
BibTeX entry: (Update)
A. Srinivasan and D. Zuckerman, "Computing with Very Weak Random Sources," FOCS 94, pp. 264275. http://citeseer.ist.psu.edu/447609.html More
@inproceedings{ srinivasan94computing,
author = "Aravind Srinivasan and David Zuckerman",
title = "Computing with Very Weak Random Sources",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "264-275",
year = "1994",
url = "citeseer.ist.psu.edu/447609.html" }
Citations (may not include all citations):199 A simple parallel algorithm for the maximal independent set .. (context) - Luby - 1986
167 Pseudo-Random Generation from One-Way Functions (context) - Impagliazzo, Levin et al. - 1989
138 Small--Bias Probability Spaces: Efficient Constructions and .. - Naor, Naor - 1993
128 Simple Constructions of Almost k-- wise Independent Random V.. - Alon, Goldreich et al. - 1992
122 How to Recycle Random Bits - Impagliazzo, Zuckerman - 1989
120 Unbiased Bits from Sources of Weak Randomness and Probabilis.. - Chor, Goldreich - 1988
102 A fast and simple randomized parallel algorithm for the maxi.. (context) - Alon, Babai et al. - 1986
98 A Random Polynomial Time Algorithm for Approximating the Vol.. - Dyer, Frieze et al. - 1991
86 Finite Fields (context) - Lidl, Niederreiter - 1983
84 Simulating BPP Using a General Weak Random Source - Zuckerman - 1996
81 The Bit Extraction Problem or t-Resilient Functions - Chor, Goldreich et al. - 1985
75 Randomness is Linear in Space - Nisan, Zuckerman - 1996
61 Expanders that Beat the Eigenvalue Bound: Explicit Construct.. - Wigderson, Zuckerman - 1993
59 The Influence of Variables on Boolean Functions (context) - Kahn, Kalai et al. - 1988
41 Generating Quasi-Random Sequences from Slightly Random Sourc.. (context) - Santha, Vazirani - 1986
40 Tiny Families of Functions with Random Properties: A Quality.. - Goldreich, Wigderson - 1997
35 On extracting randomness from weak random sources (context) - Ta-Shma - 1996
35 General Weak Random Sources (context) - Zuckerman - 1990
31 Extracting Randomness: How and Why (context) - Nisan - 1996
29 Independent Unbiased Coin Flips from a Correlated Biased Sou.. (context) - Blum - 1986
26 Strong Communication Complexity or Generating Quasi-Random S.. (context) - Vazirani - 1987
20 Efficiency Considerations in Using Semi-Random Sources (context) - Vazirani - 1987
19 On Unapproximable Versions of NP-Complete Problems - Zuckerman - 1996
19 Monte Carlo Simulations: Hidden Errors from (context) - Ferrenberg, Landau et al. - 1992
18 Collective Coin Flipping (context) - Ben-Or, Linial - 1989
18 Dispersers, Deterministic Amplification, and Weak Random Sou.. - Cohen, Wigderson - 1989
16 Randomness-Efficient Oblivious Sampling (context) - Bellare, Rompel - 1994
16 Explicit OR-Dispersers with Polylogarithmic Degree - Saks, Srinivasan et al. - 1998
12 Parallel Implementation of Algorithms for Finding Connected .. - Hsu, Ramachandran et al. - 1994
12 On Using Deterministic Functions in Probabilistic Algorithms (context) - Santha - 1987
12 Some Extremal Problems Arising from Discrete Control Process.. (context) - Lichtenstein, Linial et al. - 1989
9 Graph Augmentation and Related Problems: Theory and Practice - Hsu - 1993
9 Randomness, Adversaries and Computation (context) - Vazirani - 1986
6 Expanders, Randomness, or Time versus Space (context) - Sipser - 1988
4 Weak Random Sources, Hitting sets, and BPP Simulations - Andreev, Clementi et al. - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.utexas.edu/users/diz/pubs.html): More
Lower Bounds for Leader Election and Collective.. - Russell, Saks, Zuckerman (1999) (Correct)
Security Preserving Amplification of Hardness - Goldreich, Impagliazzo.. (1990) (Correct)
Lower Bounds for Randomized Mutual Exclusion - Kushilevitz, Mansour, Rabin.. (1993) (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