David Zuckerman

Cited by

	All	Since 2017
Citations	7951	2117
h-index	39	22
i10-index	55	45

520

260

130

390

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202239 63 70 120 94 134 128 128 177 184 146 199 202 365 287 287 327 358 413 355 385 391 373 434 385 404 395 502 415 15

Public access

View all

15 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
Russell ImpagliazzoUC, San DiegoVerified email at eng.ucsd.edu
Eshan ChattopadhyayCornell UniversityVerified email at cornell.edu
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemVerified email at cs.huji.ac.il
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityVerified email at g.harvard.edu
Michael SaksRutgers University-New BrunswickVerified email at math.rutgers.edu
Xin LiJohns Hopkins UniversityVerified email at cs.jhu.edu
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 GopalanVMware ResearchVerified email at vmware.com
Marek KarpinskiProfessor of Computer Science, University of BonnVerified email at cs.uni-bonn.de
Johannes BloemerProfessor for Computer Science, Paderborn UniversityVerified email at mail.upb.de
Alexander RussellUniversity of ConnecticutVerified email at cse.uconn.edu
Ashwin NayakUniversity of WaterlooVerified email at uwaterloo.ca
Shachar LovettAssociate Professor of Computer Science, University of California San DiegoVerified email at eng.ucsd.edu
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

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	977	2006
Randomness is linear in space N Nisan, D Zuckerman Journal of Computer and System Sciences 52 (1), 43-52, 1996	796*	1996
Optimal speedup of Las Vegas algorithms M Luby, A Sinclair, D Zuckerman Information Processing Letters 47 (4), 173-180, 1993	626	1993
An XOR-based erasure-resilient coding scheme J Bloemer, M Kalfane, R Karp, M Karpinski, M Luby, D Zuckerman	559	1995
How to recycle random bits R Impagliazzo, D Zuckerman FOCS 89, 248-253, 1989	448	1989
On unapproximable versions of NP-complete problems D Zuckerman SIAM Journal on Computing 25 (6), 1293-1304, 1996	246*	1996
Simulating BPP using a general weak random source D Zuckerman Algorithmica 16 (4), 367-391, 1996	243	1996
Randomness‐optimal oblivious sampling D Zuckerman Random Structures & Algorithms 11 (4), 345-367, 1997	239*	1997
Lossless condensers, unbalanced expanders, and extractors A Ta-Shma, C Umans, D Zuckerman Combinatorica 27 (2), 213-240, 2007	192*	2007
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography J Kamp, D Zuckerman SIAM Journal on Computing 36 (5), 1231-1247, 2007	180	2007
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	176	1993
Derandomized graph products N Alon, U Feige, A Wigderson, D Zuckerman Computational Complexity 5 (1), 60-75, 1995	170	1995
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	157	1990
Explicit two-source extractors and resilient functions E Chattopadhyay, D Zuckerman Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	151	2016
Computing with very weak random sources A Srinivasan, D Zuckerman SIAM Journal on Computing 28 (4), 1433-1459, 1999	145	1999
Asymptotically good codes correcting insertions, deletions, and transpositions LJ Schulman, D Zuckerman IEEE transactions on information theory 45 (7), 2552-2557, 1999	140	1999
General weak random sources D Zuckerman Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990	136	1990
Interaction in quantum communication H Klauck, A Nayak, A Ta-Shma, D Zuckerman IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007	120*	2007
Another Proof That (and More) O Goldreich, D Zuckerman Studies in Complexity and Cryptography. Miscellanea on the Interplay between …, 2011	115*	2011
Rectangles are nonnegative juntas M Goos, S Lovett, R Meka, T Watson, D Zuckerman SIAM Journal on Computing 45 (5), 1835-1869, 2016	111	2016

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 this author

Cited by

Co-authors