David Zuckerman

Citata da

	Tutte	Dal 2019
Citazioni	9189	2510
Indice H	42	24
i10-index	63	52

500

250

125

375

1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202445 66 71 124 80 149 146 118 178 160 155 192 225 363 290 282 340 361 419 371 373 388 374 432 388 394 384 483 404 406 409 423

Accesso pubblico

Visualizza tutto

18 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Raghu MekaUniversity of California, Los AngelesEmail verificata su cs.ucla.edu
Eshan ChattopadhyayAssociate Professor at Cornell UniversityEmail verificata su cs.cornell.edu
Michael LubyBitRipple and ICSIEmail verificata su bitripple.com
Russell ImpagliazzoUCSDEmail verificata su ucsd.edu
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityEmail verificata su g.harvard.edu
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemEmail verificata su cs.huji.ac.il
Xin LiJohns Hopkins UniversityEmail verificata su cs.jhu.edu
Michael SaksRutgers University-New BrunswickEmail verificata su math.rutgers.edu
Johannes BloemerProfessor for Computer Science, Paderborn UniversityEmail verificata su mail.upb.de
Jesse KampOracleEmail verificata su oracle.com
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceEmail verificata su weizmann.ac.il
Anup RaoProfessor of Computer Science, University of WashingtonEmail verificata su cs.washington.edu
Aravind SrinivasanProfessor of Computer Science and Distinguished University Professor, University of MarylandEmail verificata su umd.edu
Parikshit GopalanAppleEmail verificata su apple.com
Shachar LovettAssociate Professor of Computer Science, University of California San DiegoEmail verificata su eng.ucsd.edu
Alexander RussellUniversity of ConnecticutEmail verificata su cse.uconn.edu
Ashwin NayakUniversity of WaterlooEmail verificata su uwaterloo.ca
Chris UmansProfessor of Computer Science, CaltechEmail verificata su cs.caltech.edu
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityEmail verificata su cs.harvard.edu
Uriel FeigeProfessor of Computer Science, Weizmann Institute of ScienceEmail verificata su weizmann.ac.il

Segui

David Zuckerman

Professor of Computer Science, University of Texas at Austin

Email verificata su cs.utexas.edu - Home page

Pseudorandomness Randomness Theory of Computation Complexity Theory


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Linear degree extractors and the inapproximability of Max Clique and Chromatic Number D Zuckerman Theory of Computing 3, 103-128, 2007	1250	2007
Randomness is linear in space N Nisan, D Zuckerman Journal of Computer and System Sciences 52 (1), 43-52, 1996	874*	1996
Optimal speedup of Las Vegas algorithms M Luby, A Sinclair, D Zuckerman Information Processing Letters 47 (4), 173-180, 1993	765	1993
An XOR-based erasure-resilient coding scheme J Blomer, M Kalfane, R Karp, M Karpinski, M Luby, D Zuckerman ICSI Technical Report, 1995	599	1995
How to recycle random bits R Impagliazzo, D Zuckerman FOCS 30, 248-253, 1989	490	1989
On unapproximable versions of NP-complete problems D Zuckerman SIAM Journal on Computing 25 (6), 1293-1304, 1996	263*	1996
Randomness‐optimal oblivious sampling D Zuckerman Random Structures & Algorithms 11 (4), 345-367, 1997	260*	1997
Simulating BPP using a general weak random source D Zuckerman Algorithmica 16, 367-391, 1996	248	1996
Lossless condensers, unbalanced expanders, and extractors A Ta-Shma*, C Umans, D Zuckerman Combinatorica 27, 213-240, 2007	230*	2007
Explicit two-source extractors and resilient functions E Chattopadhyay, D Zuckerman Annals of Mathematics 189 (3), 653-705, 2019	194	2019
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography J Kamp, D Zuckerman SIAM Journal on Computing 36 (5), 1231-1247, 2007	192	2007
Expanders that beat the eigenvalue bound: Explicit construction and applications A Wigderson, D Zuckerman Combinatorica 19, 125-138, 1990	186	1990
Derandomized graph products N Alon, U Feige, A Wigderson, D Zuckerman Computational Complexity 5, 60-75, 1995	185	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	165	1990
Asymptotically good codes correcting insertions, deletions, and transpositions LJ Schulman, D Zuckerman IEEE transactions on information theory 45 (7), 2552-2557, 1999	161	1999
Computing with very weak random sources A Srinivasan, D Zuckerman SIAM Journal on Computing 28 (4), 1433-1459, 1999	152	1999
General weak random sources D Zuckerman Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990	144	1990
Rectangles are nonnegative juntas M Goos, S Lovett, R Meka, T Watson, D Zuckerman SIAM Journal on Computing 45 (5), 1835-1869, 2016	134	2016
Interaction in quantum communication H Klauck, A Nayak, A Ta-Shma, D Zuckerman IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007	127*	2007
Extractor codes A Ta-Shma, D Zuckerman IEEE Transactions on Information Theory 50 (12), 3015-3025, 2004	122	2004

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori