| Linear degree extractors and the inapproximability of Max Clique and Chromatic Number D Zuckerman Theory of Computing 3, 103-128, 2007 | 1375 | 2007 |
| Randomness is linear in space N Nisan, D Zuckerman Journal of Computer and System Sciences 52 (1), 43-52, 1996 | 914* | 1996 |
| Optimal speedup of Las Vegas algorithms M Luby, A Sinclair, D Zuckerman Information Processing Letters 47 (4), 173-180, 1993 | 818 | 1993 |
| An XOR-based erasure-resilient coding scheme J Blomer, M Kalfane, R Karp, M Karpinski, M Luby, D Zuckerman ICSI Technical Report, 1995 | 626 | 1995 |
| How to recycle random bits R Impagliazzo, D Zuckerman FOCS 30, 248-253, 1989 | 502 | 1989 |
| On unapproximable versions of NP-complete problems D Zuckerman SIAM Journal on Computing 25 (6), 1293-1304, 1996 | 272* | 1996 |
| Randomness‐optimal oblivious sampling D Zuckerman Random Structures & Algorithms 11 (4), 345-367, 1997 | 267* | 1997 |
| Lossless condensers, unbalanced expanders, and extractors A Ta-Shma*, C Umans, D Zuckerman Combinatorica 27 (2), 213-240, 2007 | 242* | 2007 |
| Explicit two-source extractors and resilient functions E Chattopadhyay, D Zuckerman Annals of Mathematics 189 (3), 653-705, 2019 | 219 | 2019 |
| Deterministic extractors for bit-fixing sources and exposure-resilient cryptography J Kamp, D Zuckerman SIAM Journal on Computing 36 (5), 1231-1247, 2007 | 201 | 2007 |
| Derandomized graph products N Alon, U Feige, A Wigderson, D Zuckerman Computational Complexity 5 (1), 60-75, 1995 | 191 | 1995 |
| Expanders that beat the eigenvalue bound: Explicit construction and applications A Wigderson, D Zuckerman Combinatorica 19, 125-138, 1990 | 189* | 1990 |
| Simulating BPP using a general weak random source D Zuckerman Algorithmica 16 (4), 367-391, 1996 | 181 | 1996 |
| Asymptotically good codes correcting insertions, deletions, and transpositions LJ Schulman, D Zuckerman IEEE transactions on information theory 45 (7), 2552-2557, 2002 | 179 | 2002 |
| Security preserving amplification of hardness O Goldreich, R Impagliazzo, L Levin, R Venkatesan, D Zuckerman Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990 | 162 | 1990 |
| Computing with very weak random sources A Srinivasan, D Zuckerman SIAM Journal on Computing 28 (4), 1433-1459, 1999 | 154 | 1999 |
| General weak random sources D Zuckerman Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990 | 152 | 1990 |
| Rectangles are nonnegative juntas M Goos, S Lovett, R Meka, T Watson, D Zuckerman SIAM Journal on Computing 45 (5), 1835-1869, 2016 | 146 | 2016 |
| Interaction in quantum communication H Klauck, A Nayak, A Ta-Shma, D Zuckerman IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007 | 133* | 2007 |
| Another proof that BPP in PH (and more) O Goldreich, D Zuckerman Studies in Complexity and Cryptography. Miscellanea on the Interplay between …, 2011 | 126* | 2011 |
Raghu MekaUniversity of California, Los AngelesVerified email at cs.ucla.edu
