David Zuckerman - Google Scholar

Cited by

	All	Since 2015
Citations	7255	2348
h-index	38	22
i10-index	53	40

420

210

105

315

199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202044 78 74 121 89 135 122 126 168 161 142 187 207 371 278 275 325 357 409 354 385 371 365 417 393 393 400 379

Co-authors

Michael LubyInternational Computer Science InstituteVerified email at icsi.berkeley.edu
Raghu MekaUniversity of California, Los AngelesVerified email at cs.ucla.edu
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
Jesse KampOracleVerified email at oracle.com
Anup RaoProfessor of Computer Science, University of WashingtonVerified email at cs.washington.edu
Xin LiJohns Hopkins UniversityVerified email at cs.jhu.edu
Aravind SrinivasanProfessor of Computer Science, University of MarylandVerified email at cs.umd.edu
Parikshit GopalanVMwareVerified email at vmware.com
Marek KarpinskiProfessor of Computer Science, University of BonnVerified email at cs.uni-bonn.de
Ashwin NayakUniversity of WaterlooVerified email at uwaterloo.ca
Johannes BloemerProfessor for Computer Science, Paderborn UniversityVerified email at mail.upb.de
Alexander RussellUniversity of ConnecticutVerified email at cse.uconn.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
Hartmut KlauckPrincipal Investigator, Centre for Quantum TechnologiesVerified email at hklauck.com

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	858	2006
Randomness is linear in space N Nisan, D Zuckerman Journal of Computer and System Sciences 52 (1), 43-52, 1996	730*	1996
Optimal speedup of Las Vegas algorithms M Luby, A Sinclair, D Zuckerman Information Processing Letters 47 (4), 173-180, 1993	554	1993
An XOR-based erasure-resilient coding scheme J Bloemer, M Kalfane, R Karp, M Karpinski, M Luby, D Zuckerman	503	1995
How to recycle random bits R Impagliazzo, D Zuckerman FOCS 30, 248-253, 1989	431	1989
Simulating BPP using a general weak random source D Zuckerman Algorithmica 16 (4-5), 367-391, 1996	236*	1996
On unapproximable versions of NP-complete problems D Zuckerman SIAM Journal on Computing 25 (6), 1293-1304, 1996	232*	1996
Randomness‐optimal oblivious sampling D Zuckerman Random Structures & Algorithms 11 (4), 345-367, 1997	228*	1997
Lossless condensers, unbalanced expanders, and extractors A Ta-Shma, C Umans, D Zuckerman Combinatorica 27 (2), 213-240, 2007	179*	2007
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography J Kamp, D Zuckerman SIAM Journal on Computing 36 (5), 1231-1247, 2007	172	2007
Expanders that beat the eigenvalue bound: Explicit construction and applications A Wigderson, D Zuckerman Combinatorica 19 (1), 125-138, 1999	171	1999
Derandomized graph products N Alon, U Feige, A Wigderson, D Zuckerman Computational Complexity 5 (1), 60-75, 1995	165	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	145	1990
Computing with very weak random sources A Srinivasan, D Zuckerman SIAM Journal on Computing 28 (4), 1433-1459, 1999	141	1999
General weak random sources D Zuckerman Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990	135	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	122	2016
Asymptotically good codes correcting insertions, deletions, and transpositions LJ Schulman, D Zuckerman IEEE transactions on information theory 45 (7), 2552-2557, 1999	122	1999
Interaction in quantum communication H Klauck, A Nayak, A Ta-Shma, D Zuckerman IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007	114*	2007
Extractor codes A Ta-Shma, D Zuckerman IEEE Transactions on Information Theory 50 (12), 3015-3025, 2004	100	2004
Tight analyses of two local load balancing algorithms B Ghosh, FT Leighton, BM Maggs, S Muthukrishnan, CG Plaxton, ... SIAM Journal on Computing 29 (1), 29-64, 1999	99*	1999

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

Upload PDF

Follow this author

Cited by

Co-authors