David Zuckerman - Google Scholar Citations

Cited by

	All	Since 2015
Citations	6938	2057
h-index	38	21
i10-index	53	38

440

220

110

330

199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202050 77 80 124 94 141 116 140 163 169 139 182 207 366 274 266 322 353 407 342 381 368 367 415 389 427 412 47

Co-authors

Michael LubyInternational Computer Science InstituteVerified email at icsi.berkeley.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
Michael SaksRutgers University-New BrunswickVerified email at math.rutgers.edu
Jesse KampOracleVerified email at oracle.com
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityVerified email at g.harvard.edu
Anup RaoProfessor of Computer Science, University of WashingtonVerified email at cs.washington.edu
Alexander RussellUniversity of ConnecticutVerified email at cse.uconn.edu
Aravind SrinivasanProfessor of Computer Science, University of MarylandVerified email at cs.umd.edu
Xin LiJohns Hopkins UniversityVerified email at cs.jhu.edu
Parikshit GopalanVMwareVerified 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
Ashwin NayakUniversity of WaterlooVerified email at uwaterloo.ca
Chris UmansProfessor of Computer Science, CaltechVerified email at cs.caltech.edu
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityVerified email at cs.harvard.edu
Hartmut KlauckPrincipal Investigator, Centre for Quantum TechnologiesVerified email at hklauck.com
Venkatesan GuruswamiCarnegie Mellon UniversityVerified email at cmu.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	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	790	2006
Randomness is linear in space N Nisan, D Zuckerman Journal of Computer and System Sciences 52 (1), 43-52, 1996	711*	1996
Optimal speedup of Las Vegas algorithms M Luby, A Sinclair, D Zuckerman Information Processing Letters 47 (4), 173-180, 1993	512	1993
An XOR-based erasure-resilient coding scheme J Bloemer, M Kalfane, R Karp, M Karpinski, M Luby, D Zuckerman	501	1995
How to recycle random bits R Impagliazzo, D Zuckerman FOCS 30, 248-253, 1989	423	1989
Simulating BPP using a general weak random source D Zuckerman Algorithmica 16 (4-5), 367-391, 1996	231*	1996
On unapproximable versions of NP-complete problems D Zuckerman SIAM Journal on Computing 25 (6), 1293-1304, 1996	229*	1996
Randomness‐optimal oblivious sampling D Zuckerman Random Structures & Algorithms 11 (4), 345-367, 1997	222*	1997
Lossless condensers, unbalanced expanders, and extractors A Ta-Shma, C Umans, D Zuckerman Combinatorica 27 (2), 213-240, 2007	175*	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	166	1993
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography J Kamp, D Zuckerman SIAM Journal on Computing 36 (5), 1231-1247, 2007	164	2007
Derandomized graph products N Alon, U Feige, A Wigderson, D Zuckerman Computational Complexity 5 (1), 60-75, 1995	161	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	146	1990
Computing with very weak random sources A Srinivasan, D Zuckerman SIAM Journal on Computing 28 (4), 1433-1459, 1999	142	1999
General weak random sources D Zuckerman Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990	133	1990
Asymptotically good codes correcting insertions, deletions, and transpositions LJ Schulman, D Zuckerman IEEE transactions on information theory 45 (7), 2552-2557, 1999	115	1999
Explicit two-source extractors and resilient functions E Chattopadhyay, D Zuckerman Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	107	2016
Interaction in quantum communication H Klauck, A Nayak, A Ta-Shma, D Zuckerman IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007	107*	2007
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	100*	1999
Extractor codes A Ta-Shma, D Zuckerman IEEE Transactions on Information Theory 50 (12), 3015-3025, 2004	97	2004

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