David Zuckerman

Citace

	Všechny	Od 2019
Citace	9099	2431
h-index	42	23
i10-index	63	52

500

250

125

375

1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202444 66 69 124 80 149 146 118 178 159 155 192 225 363 290 282 339 362 418 371 370 388 374 432 388 394 384 482 406 405 407 347

Veřejný přístup

Zobrazit všechny

18 článků

0 článků

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Raghu MekaUniversity of California, Los AngelesE-mailová adresa ověřena na: cs.ucla.edu
Eshan ChattopadhyayAssociate Professor at Cornell UniversityE-mailová adresa ověřena na: cs.cornell.edu
Michael LubyBitRipple and ICSIE-mailová adresa ověřena na: bitripple.com
Russell ImpagliazzoUCSDE-mailová adresa ověřena na: ucsd.edu
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityE-mailová adresa ověřena na: g.harvard.edu
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemE-mailová adresa ověřena na: cs.huji.ac.il
Xin LiJohns Hopkins UniversityE-mailová adresa ověřena na: cs.jhu.edu
Michael SaksRutgers University-New BrunswickE-mailová adresa ověřena na: math.rutgers.edu
Johannes BloemerProfessor for Computer Science, Paderborn UniversityE-mailová adresa ověřena na: mail.upb.de
Jesse KampOracleE-mailová adresa ověřena na: oracle.com
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceE-mailová adresa ověřena na: weizmann.ac.il
Anup RaoProfessor of Computer Science, University of WashingtonE-mailová adresa ověřena na: cs.washington.edu
Parikshit GopalanAppleE-mailová adresa ověřena na: apple.com
Aravind SrinivasanProfessor of Computer Science and Distinguished University Professor, University of MarylandE-mailová adresa ověřena na: umd.edu
Shachar LovettAssociate Professor of Computer Science, University of California San DiegoE-mailová adresa ověřena na: eng.ucsd.edu
Alexander RussellUniversity of ConnecticutE-mailová adresa ověřena na: cse.uconn.edu
Ashwin NayakUniversity of WaterlooE-mailová adresa ověřena na: uwaterloo.ca
Chris UmansProfessor of Computer Science, CaltechE-mailová adresa ověřena na: cs.caltech.edu
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityE-mailová adresa ověřena na: cs.harvard.edu
Uriel FeigeProfessor of Computer Science, Weizmann Institute of ScienceE-mailová adresa ověřena na: weizmann.ac.il

Sledovat

David Zuckerman

Professor of Computer Science, University of Texas at Austin

E-mailová adresa ověřena na: cs.utexas.edu - Domovská stránka

Pseudorandomness Randomness Theory of Computation Complexity Theory


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Linear degree extractors and the inapproximability of Max Clique and Chromatic Number D Zuckerman Theory of Computing 3, 103-128, 2007	1232	2007
Randomness is linear in space N Nisan, D Zuckerman Journal of Computer and System Sciences 52 (1), 43-52, 1996	864*	1996
Optimal speedup of Las Vegas algorithms M Luby, A Sinclair, D Zuckerman Information Processing Letters 47 (4), 173-180, 1993	759	1993
An XOR-based erasure-resilient coding scheme J Blomer, M Kalfane, R Karp, M Karpinski, M Luby, D Zuckerman ICSI Technical Report, 1995	596	1995
How to recycle random bits R Impagliazzo, D Zuckerman FOCS 30, 248-253, 1989	483	1989
On unapproximable versions of NP-complete problems D Zuckerman SIAM Journal on Computing 25 (6), 1293-1304, 1996	261*	1996
Randomness‐optimal oblivious sampling D Zuckerman Random Structures & Algorithms 11 (4), 345-367, 1997	257*	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	228*	2007
Explicit two-source extractors and resilient functions E Chattopadhyay, D Zuckerman Annals of Mathematics 189 (3), 653-705, 2019	192	2019
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography J Kamp, D Zuckerman SIAM Journal on Computing 36 (5), 1231-1247, 2007	189	2007
Derandomized graph products N Alon, U Feige, A Wigderson, D Zuckerman Computational Complexity 5, 60-75, 1995	185	1995
Expanders that beat the eigenvalue bound: Explicit construction and applications A Wigderson, D Zuckerman Combinatorica 19, 125-138, 1990	185	1990
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	150	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	132	2016
Interaction in quantum communication H Klauck, A Nayak, A Ta-Shma, D Zuckerman IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007	124*	2007
Another proof that (and more) O Goldreich, D Zuckerman Studies in Complexity and Cryptography. Miscellanea on the Interplay between …, 2011	121	2011

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři