Ran Raz, Omer Reingold, Salil Vadhan  Home/Search
Context Related
| mit.edu/~salil/papers/trev.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: mit.edu/~salil/research (more) Homepages: R.Raz |
Rate this article:      (best)Comment on this article |
Abstract: We give explicit constructions of extractors which work for a source of any min-entropy on strings of length n. The first construction extracts any constant fraction of the min-entropy using O(log 2 n) additional random bits. The second extracts all the min-entropy using O(log 3 n) additional random bits. Both of these constructions use fewer truly random bits than any previous construction which works for all min-entropies and extracts a constant fraction of the min-entropy. We then improve... (Update)
Cited by: More
Secret-Key Agreement over Unauthenticated Public Channels -.. - Maurer, Wolf (2003) (Correct)
Unconditional Authenticity and Privacy from an Arbitrarily.. - Renner, Wolf (2003) (Correct)
Loss-less Condensers, Unbalanced Expanders, and Extractors - Ta-Shma, Umans, Zuckerman (Correct)
Similar documents (at the sentence level):
69.2%: Extracting all the Randomness and Reducing the Error in.. - Raz, Reingold, Vadhan (1999) (Correct)
42.3%: Extracting All the Randomness from a Weakly Random Source - Vadhan (1998) (Correct)
Active bibliography (related documents): More All
0.5: The Computational Complexity Column - Lance Fortnow Nec (Correct)
0.4: Extracting Randomness from Samplable Distributions (Extended .. - Trevisan, Vadhan (2000) (Correct)
0.4: Extracting Randomness: A Survey and New Constructions - Nisan, Ta-Shma (1998) (Correct)
Similar documents based on text: More All
1.2: Extractors and Pseudorandom Generators - Trevisan (1999) (Correct)
1.0: On Constructing Locally Computable Extractors and Cryptosystems.. - Vadhan (2002) (Correct)
0.8: Extractors: Optimal up to Constant Factors - Lu, Reingold, Vadhan (2003) (Correct)
Related documents from co-citation: More All
31: Construction of extractors using pseudorandom generators - Trevisan - 1999
28: Randomness is Linear in Space - Nisan, Zuckerman - 1993
26: Expanders that Beat the Eigenvalue Bound, Explicit Construction and Applications - Wigderson, Zuckerman - 1993
BibTeX entry: (Update)
Ran Raz, Omer Reingold, and Salil Vadhan. Extracting all the randomness and reducing the error in Trevisan's extractors. In Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing, Atlanta, GA, 1999. http://citeseer.ist.psu.edu/article/raz99extracting.html More
@inproceedings{ raz99extracting,
author = "Ran Raz and Omer Reingold and Salil Vadhan",
title = "Extracting all the randomness and reducing the error in {Trevisan}'s extractors",
pages = "149--158",
year = "1999",
url = "citeseer.ist.psu.edu/article/raz99extracting.html" }
Citations (may not include all citations):837 Cambridge University Press (context) - Motwani, Raghavan - 1995
339 Theory and applications of trapdoor functions (context) - Yao - 1982
167 Pseudo-random generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989
120 Unbiased bits from sources of weak randomness and probabilis.. - Chor, Goldreich - 1988
84 Simulating BPP using a general weak random source - Zuckerman - 1996
75 Randomness is linear in space - Nisan, Zuckerman - 1996
68 Hardness vs randomness (context) - Nisan, Wigderson - 1994
64 Pseudorandom generators without the XOR lemma - Sudan, Trevisan et al. - 1998
61 Expanders that beat the eigenvalue bound: Explicit construct.. - Wigderson, Zuckerman - 1995
60 Computing with very weak random sources - Srinivasan, Zuckerman - 1998
46 Random polynomial time is equal to slightly-random polynomia.. (context) - Vazirani, Vazirani - 1985
44 Generating quasi-random sequences from semi-random sources (context) - Santha, Vazirani - 1986
40 Tiny families of functions with random properties: A quality.. - Goldreich, Wigderson - 1997
37 Wiley-Interscience Series in Discrete Mathematics and Optimi.. (context) - Alon, Spencer et al. - 1992
36 Extracting randomness: A survey and new constructions - Nisan, Ta-Shma - 1998
36 Randomness-optimal oblivious sampling - Zuckerman - 1997
35 On extracting randomness from weak random sources (context) - Ta-Shma - 1996
29 Sorting and selecting in rounds (context) - Pippenger - 1987
28 or time versus space (context) - Sipser, randomness - 1988
28 Extracting randomness: How and why: A survey (context) - Nisan - 1996
26 Strong communication complexity or generating quasirandom se.. (context) - Vazirani - 1987
26 Constructions of near-optimal extractors using pseudo-random.. - Trevisan - 1998
20 Efficiency considerations in using semi-random sources (context) - Vazirani - 1987
19 Almost optimal dispersers - Ta-Shma - 1998
17 Another proof that BPP ` PH (context) - Goldreich, Zuckerman - 1997
16 On recycling the randomness of the states in space bounded c.. - Raz, Reingold - 1999
16 Explicit OR-dispersers with polylogarithmic degree - Saks, Srinivasan et al. - 1998
16 Tight bounds for depth-two superconcentrators - Radhakrishnan, Ta-Shma - 1997
9 Almost sorting in one round (context) - Ajtai, Komlos et al. - 1989
8 University of California (context) - Vazirani, Adversaries et al. - 1984
7 Personal communication (context) - Ta-Shma - 1998
5 Number 103 in Cambridge Tracts in Mathematics (context) - Assmus, Key et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.lcs.mit.edu/~salil/research.html): More
Comparing Entropies in Statistical Zero Knowledge with.. - Goldreich, Vadhan (1999) (Correct)
The Complexity of Counting in Sparse, Regular, and Planar Graphs - Vadhan (1997) (Correct)
Checking Polynomial Identities over any Field: Towards a.. - Lewin, Vadhan (1998) (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