David Zuckerman

Cited by

	All	Since 2018
Citations	8520	2281
h-index	41	22
i10-index	58	46

500

250

125

375

199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202339 65 77 117 76 128 149 118 187 161 153 189 225 372 299 276 337 353 413 357 374 398 369 441 383 396 377 488 411 427 181

Public access

View all

14 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Raghu MekaUniversity of California, Los AngelesVerified email at cs.ucla.edu
Michael LubyBitRipple and ICSIVerified email at bitripple.com
Eshan ChattopadhyayCornell UniversityVerified email at cornell.edu
Russell ImpagliazzoUC, San DiegoVerified email at eng.ucsd.edu
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemVerified email at cs.huji.ac.il
Xin LiJohns Hopkins UniversityVerified email at cs.jhu.edu
Michael SaksRutgers University-New BrunswickVerified email at math.rutgers.edu
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityVerified email at g.harvard.edu
Johannes BloemerProfessor for Computer Science, Paderborn UniversityVerified email at mail.upb.de
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il
Jesse KampOracleVerified email at oracle.com
Anup RaoProfessor of Computer Science, University of WashingtonVerified email at cs.washington.edu
Aravind SrinivasanProfessor of Computer Science and Distinguished University Professor, University of MarylandVerified email at umd.edu
Parikshit GopalanAppleVerified email at apple.com
Alexander RussellUniversity of ConnecticutVerified email at cse.uconn.edu
Shachar LovettAssociate Professor of Computer Science, University of California San DiegoVerified email at eng.ucsd.edu
Ashwin NayakUniversity of WaterlooVerified email at uwaterloo.ca
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityVerified email at cs.harvard.edu
Chris UmansProfessor of Computer Science, CaltechVerified email at cs.caltech.edu
Uriel FeigeProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il

David Zuckerman

Professor of Computer Science, University of Texas at Austin

Verified email at cs.utexas.edu - Homepage

Pseudorandomness Randomness Theory of Computation Complexity Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Linear degree extractors and the inapproximability of max clique and chromatic number D Zuckerman Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006	1099	2006
Randomness is linear in space N Nisan, D Zuckerman Journal of Computer and System Sciences 52 (1), 43-52, 1996	833*	1996
Optimal speedup of Las Vegas algorithms M Luby, A Sinclair, D Zuckerman Information Processing Letters 47 (4), 173-180, 1993	701	1993
An XOR-based erasure-resilient coding scheme J Blomer Technical report at ICSI, 1995	572	1995
How to recycle random bits R Impagliazzo, D Zuckerman FOCS 30, 248-253, 1989	468	1989
On unapproximable versions of NP-complete problems D Zuckerman SIAM Journal on Computing 25 (6), 1293-1304, 1996	252*	1996
Simulating BPP using a general weak random source D Zuckerman Algorithmica 16, 367-391, 1996	245	1996
Randomness‐optimal oblivious sampling D Zuckerman Random Structures & Algorithms 11 (4), 345-367, 1997	244*	1997
Lossless condensers, unbalanced expanders, and extractors A Ta-Shma*, C Umans, D Zuckerman Combinatorica 27, 213-240, 2007	209*	2007
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography J Kamp, D Zuckerman SIAM Journal on Computing 36 (5), 1231-1247, 2007	181	2007
Derandomized graph products N Alon, U Feige, A Wigderson, D Zuckerman Computational Complexity 5, 60-75, 1995	180	1995
Expanders that beat the eigenvalue bound: Explicit construction and applications A Wigderson, D Zuckerman Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993	180	1993
Explicit two-source extractors and resilient functions E Chattopadhyay, D Zuckerman Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	172	2016
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
Asymptotically good codes correcting insertions, deletions, and transpositions LJ Schulman, D Zuckerman IEEE transactions on information theory 45 (7), 2552-2557, 1999	148	1999
Computing with very weak random sources A Srinivasan, D Zuckerman SIAM Journal on Computing 28 (4), 1433-1459, 1999	145	1999
General weak random sources D Zuckerman Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990	139	1990
Interaction in quantum communication H Klauck, A Nayak, A Ta-Shma, D Zuckerman IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007	124*	2007
Another Proof That (and More) O Goldreich, D Zuckerman Studies in Complexity and Cryptography. Miscellanea on the Interplay between …, 2011	120*	2011
Combinatorial bounds for list decoding V Guruswami, J Hastad, M Sudan, D Zuckerman IEEE Transactions on Information Theory 48 (5), 1021-1034, 2002	114	2002

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors