Folgen
David Zuckerman
David Zuckerman
Professor of Computer Science, University of Texas at Austin
Bestätigte E-Mail-Adresse bei cs.utexas.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Linear degree extractors and the inapproximability of Max Clique and Chromatic Number
D Zuckerman
Theory of Computing 3, 103-128, 2007
12332007
Randomness is linear in space
N Nisan, D Zuckerman
Journal of Computer and System Sciences 52 (1), 43-52, 1996
865*1996
Optimal speedup of Las Vegas algorithms
M Luby, A Sinclair, D Zuckerman
Information Processing Letters 47 (4), 173-180, 1993
7601993
An XOR-based erasure-resilient coding scheme
J Blomer, M Kalfane, R Karp, M Karpinski, M Luby, D Zuckerman
ICSI Technical Report, 1995
5961995
How to recycle random bits
R Impagliazzo, D Zuckerman
FOCS 30, 248-253, 1989
4841989
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
257*1997
Simulating BPP using a general weak random source
D Zuckerman
Algorithmica 16, 367-391, 1996
2481996
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
1922019
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography
J Kamp, D Zuckerman
SIAM Journal on Computing 36 (5), 1231-1247, 2007
1902007
Derandomized graph products
N Alon, U Feige, A Wigderson, D Zuckerman
Computational Complexity 5, 60-75, 1995
1851995
Expanders that beat the eigenvalue bound: Explicit construction and applications
A Wigderson, D Zuckerman
Combinatorica 19, 125-138, 1990
1851990
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
1651990
Asymptotically good codes correcting insertions, deletions, and transpositions
LJ Schulman, D Zuckerman
IEEE transactions on information theory 45 (7), 2552-2557, 1999
1611999
Computing with very weak random sources
A Srinivasan, D Zuckerman
SIAM Journal on Computing 28 (4), 1433-1459, 1999
1501999
General weak random sources
D Zuckerman
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990
1441990
Rectangles are nonnegative juntas
M Goos, S Lovett, R Meka, T Watson, D Zuckerman
SIAM Journal on Computing 45 (5), 1835-1869, 2016
1322016
Interaction in quantum communication
H Klauck, A Nayak, A Ta-Shma, D Zuckerman
IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007
125*2007
Another proof that (and more)
O Goldreich, D Zuckerman
Studies in Complexity and Cryptography. Miscellanea on the Interplay between …, 2011
1212011
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20