Reconstructive dispersers and hitting set generators (2005)

by Christopher Umans
Venue:In APPROXRANDOM
Citations:6 - 3 self

Active Bibliography

The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
107 Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator – Ronen Shaltiel, Christopher Umans - 2001
4 Low-end Uniform Hardness vs. Randomness Tradeoffs for AM – Ronen Shaltiel, Christopher Umans - 2007
3 Pseudorandomness and combinatorial constructions – Luca Trevisan - 2006
77 Unbalanced expanders and randomness extractors from parvaresh-vardy codes – Venkatesan Guruswami, Christopher Umans - 2007
39 Extractors from Reed-Muller Codes – Amnon Ta-shma, David Zuckerman, Shmuel Safra - 2001
6 Reducing the seed length in the NisanWigderson generator – Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
8 Uniform Hardness Versus Randomness Tradeoffs For Arthur-Merlin Games – Dan Gutfreund, Ronen Shaltiel, Amnon Ta-shma - 2003
23 Pseudorandomness for approximate counting and sampling – Ronen Shaltiel, Christopher Umans - 2005
54 Pseudorandomness and average-case complexity via uniform reductions – Luca Trevisan, Salil Vadhan - 2002
11 Hardness as randomness: A survey of universal derandomization – Russell Impagliazzo - 2002
16 Computational analogues of entropy – Boaz Barak, Ronen Shaltiel, Avi Wigderson - 2003
6 Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games – Dan Gutfreund, Ronen Shaltiel
2 Uniform Derandomization from Pathetic Lower Bounds – Eric Allender, Fengming Wang - 2009
7 MAking Hard Problems Harder – Rahul Santhanam, et al. - 2005
10 Hardness vs. Randomness within Alternating Time – Emanuele Viola - 2003
36 The complexity of constructing pseudorandom generators from hard functions – Emanuele Viola - 2004
1 LOW-END UNIFORM HARDNESS VERSUS RANDOMNESS TRADEOFFS FOR AM – Ronen Shaltiel, Christopher Umans - 2009
15 Derandomizing Arthur-Merlin Games under Uniform Assumptions – Chi-Jen Lu - 2000