David Zuckerman - Google Scholar Citations

Cited by

	All	Since 2014
Citations	6847	2345
h-index	38	24
i10-index	53	41

420

210

105

315

199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201917 42 73 78 126 93 136 120 125 162 178 136 176 214 367 279 269 326 353 405 343 379 372 368 416 389 409 391

Co-authors

Michael LubyInternational Computer Science InstituteVerified email at icsi.berkeley.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
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il
Michael SaksRutgers University-New BrunswickVerified email at math.rutgers.edu
Eshan ChattopadhyayCornell UniversityVerified email at cornell.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
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
Alexander RussellUniversity of ConnecticutVerified email at cse.uconn.edu
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 KlauckAssistant Professor of Mathematics, Nanyang Technological UniversityVerified email at ntu.edu.sg
Trevor WooleyAndris A. Zoltners Professor of Excellence, Purdue UniversityVerified email at purdue.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	781	2006
Randomness is linear in space N Nisan, D Zuckerman Journal of Computer and System Sciences 52 (1), 43-52, 1996	698*	1996
Optimal speedup of Las Vegas algorithms M Luby, A Sinclair, D Zuckerman Information Processing Letters 47 (4), 173-180, 1993	507	1993
An XOR-based erasure-resilient coding scheme J Bloemer, M Kalfane, R Karp, M Karpinski, M Luby, D Zuckerman	500	1995
How to recycle random bits R Impagliazzo, D Zuckerman 30th Annual Symposium on Foundations of Computer Science, 248-253, 1989	416	1989
Simulating BPP using a general weak random source D Zuckerman Algorithmica 16 (4-5), 367-391, 1996	232*	1996
On unapproximable versions of NP-complete problems D Zuckerman SIAM Journal on Computing 25 (6), 1293-1304, 1996	228*	1996
Randomness‐optimal oblivious sampling D Zuckerman Random Structures & Algorithms 11 (4), 345-367, 1997	219*	1997
Lossless condensers, unbalanced expanders, and extractors A Ta-Shma, C Umans, D Zuckerman Combinatorica 27 (2), 213-240, 2007	173*	2007
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography J Kamp, D Zuckerman SIAM Journal on Computing 36 (5), 1231-1247, 2006	166	2006
Expanders that beat the eigenvalue bound: Explicit construction and applications A Wigderson, D Zuckerman Combinatorica 19 (1), 125-138, 1999	163*	1999
Derandomized graph products N Alon, U Feige, A Wigderson, D Zuckerman Computational Complexity 5 (1), 60-75, 1995	157	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	144	1990
Computing with very weak random sources A Srinivasan, D Zuckerman SIAM Journal on Computing 28 (4), 1433-1459, 1999	140	1999
General weak random sources D Zuckerman Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990	134	1990
Asymptotically good codes correcting insertions, deletions, and transpositions LJ Schulman, D Zuckerman IEEE transactions on information theory 45 (7), 2552-2557, 1999	112	1999
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
Explicit two-source extractors and resilient functions E Chattopadhyay, D Zuckerman Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	100	2016
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	97*	1999
Extractors from Reed–Muller codes A Ta-Shma, D Zuckerman, S Safra Journal of Computer and System Sciences 72 (5), 786-812, 2006	95	2006

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