David Zuckerman

Navedeno

	Vse	Od leta 2020
Navedbe	9346	2238
indeks h	43	23
indeks i10	64	53

500

250

125

375

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202550 75 68 125 82 145 155 118 190 161 161 199 227 368 289 282 346 360 425 374 369 390 373 430 389 397 384 485 406 408 393 480 66

Javni dostop

Prikaži vse

19 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Raghu MekaUniversity of California, Los AngelesPreverjeni e-poštni naslov na cs.ucla.edu
Eshan ChattopadhyayAssociate Professor at Cornell UniversityPreverjeni e-poštni naslov na cs.cornell.edu
Russell ImpagliazzoUCSDPreverjeni e-poštni naslov na ucsd.edu
Michael LubyBitRipple and ICSIPreverjeni e-poštni naslov na bitripple.com
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityPreverjeni e-poštni naslov na g.harvard.edu
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemPreverjeni e-poštni naslov na cs.huji.ac.il
Oded GoldreichProfessor of Computer Science, Weizmann Institute of SciencePreverjeni e-poštni naslov na weizmann.ac.il
Xin LiJohns Hopkins UniversityPreverjeni e-poštni naslov na cs.jhu.edu
Michael SaksRutgers University-New BrunswickPreverjeni e-poštni naslov na math.rutgers.edu
Anup RaoProfessor of Computer Science, University of WashingtonPreverjeni e-poštni naslov na cs.washington.edu
Johannes BloemerProfessor for Computer Science, Paderborn UniversityPreverjeni e-poštni naslov na mail.upb.de
Jesse KampOraclePreverjeni e-poštni naslov na oracle.com
Shachar LovettFull Professor of Computer Science, University of California San DiegoPreverjeni e-poštni naslov na eng.ucsd.edu
Venkatesan GuruswamiUniversity of California, BerkeleyPreverjeni e-poštni naslov na berkeley.edu
Parikshit GopalanApplePreverjeni e-poštni naslov na apple.com
Aravind SrinivasanProfessor of Computer Science and Distinguished University Professor, University of MarylandPreverjeni e-poštni naslov na umd.edu
Alexander RussellUniversity of ConnecticutPreverjeni e-poštni naslov na cse.uconn.edu
Ashwin NayakUniversity of WaterlooPreverjeni e-poštni naslov na uwaterloo.ca
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityPreverjeni e-poštni naslov na cs.harvard.edu
Chris UmansProfessor of Computer Science, CaltechPreverjeni e-poštni naslov na cs.caltech.edu

Spremljaj

David Zuckerman

Professor of Computer Science, University of Texas at Austin

Preverjeni e-poštni naslov na cs.utexas.edu - Domača stran

Pseudorandomness Randomness Theory of Computation Complexity Theory


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Linear degree extractors and the inapproximability of Max Clique and Chromatic Number D Zuckerman Theory of Computing 3, 103-128, 2007	1282	2007
Randomness is linear in space N Nisan, D Zuckerman Journal of Computer and System Sciences 52 (1), 43-52, 1996	884*	1996
Optimal speedup of Las Vegas algorithms M Luby, A Sinclair, D Zuckerman Information Processing Letters 47 (4), 173-180, 1993	771	1993
An XOR-based erasure-resilient coding scheme J Blomer, M Kalfane, R Karp, M Karpinski, M Luby, D Zuckerman ICSI Technical Report, 1995	610	1995
How to recycle random bits R Impagliazzo, D Zuckerman FOCS 30, 248-253, 1989	497	1989
On unapproximable versions of NP-complete problems D Zuckerman SIAM Journal on Computing 25 (6), 1293-1304, 1996	267*	1996
Randomness‐optimal oblivious sampling D Zuckerman Random Structures & Algorithms 11 (4), 345-367, 1997	265*	1997
Lossless condensers, unbalanced expanders, and extractors A Ta-Shma*, C Umans, D Zuckerman Combinatorica 27, 213-240, 2007	232*	2007
Explicit two-source extractors and resilient functions E Chattopadhyay, D Zuckerman Annals of Mathematics 189 (3), 653-705, 2019	197	2019
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography J Kamp, D Zuckerman SIAM Journal on Computing 36 (5), 1231-1247, 2007	193	2007
Derandomized graph products N Alon, U Feige, A Wigderson, D Zuckerman Computational Complexity 5, 60-75, 1995	188	1995
Expanders that beat the eigenvalue bound: Explicit construction and applications A Wigderson, D Zuckerman Combinatorica 19, 125-138, 1990	188*	1990
Simulating BPP using a general weak random source D Zuckerman Algorithmica 16, 367-391, 1996	178	1996
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	168	1990
Asymptotically good codes correcting insertions, deletions, and transpositions LJ Schulman, D Zuckerman IEEE transactions on information theory 45 (7), 2552-2557, 1999	164	1999
Computing with very weak random sources A Srinivasan, D Zuckerman SIAM Journal on Computing 28 (4), 1433-1459, 1999	153	1999
General weak random sources D Zuckerman Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990	147	1990
Rectangles are nonnegative juntas M Goos, S Lovett, R Meka, T Watson, D Zuckerman SIAM Journal on Computing 45 (5), 1835-1869, 2016	136	2016
Interaction in quantum communication H Klauck, A Nayak, A Ta-Shma, D Zuckerman IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007	128*	2007
Another proof that (and more) O Goldreich, D Zuckerman Studies in Complexity and Cryptography. Miscellanea on the Interplay between …, 2011	124	2011

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji