Obserwuj
David Zuckerman
David Zuckerman
Professor of Computer Science, University of Texas at Austin
Zweryfikowany adres z cs.utexas.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
10122006
Randomness is linear in space
N Nisan, D Zuckerman
Journal of Computer and System Sciences 52 (1), 43-52, 1996
806*1996
Optimal speedup of Las Vegas algorithms
M Luby, A Sinclair, D Zuckerman
Information Processing Letters 47 (4), 173-180, 1993
6451993
An XOR-based erasure-resilient coding scheme
J Bloemer, M Kalfane, R Karp, M Karpinski, M Luby, D Zuckerman
5581995
How to recycle random bits
R Impagliazzo, D Zuckerman
FOCS 30, 248-253, 1989
4541989
On unapproximable versions of NP-complete problems
D Zuckerman
SIAM Journal on Computing 25 (6), 1293-1304, 1996
248*1996
Simulating BPP using a general weak random source
D Zuckerman
Algorithmica 16 (4), 367-391, 1996
2431996
Randomness‐optimal oblivious sampling
D Zuckerman
Random Structures & Algorithms 11 (4), 345-367, 1997
238*1997
Lossless condensers, unbalanced expanders, and extractors
A Ta-Shma*, C Umans, D Zuckerman
Combinatorica 27, 213-240, 2007
196*2007
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography
J Kamp, D Zuckerman
SIAM Journal on Computing 36 (5), 1231-1247, 2007
1812007
Expanders that beat the eigenvalue bound: Explicit construction and applications
A Wigderson, D Zuckerman
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993
1811993
Derandomized graph products
N Alon, U Feige, A Wigderson, D Zuckerman
Computational Complexity 5 (1), 60-75, 1995
1751995
Explicit two-source extractors and resilient functions
E Chattopadhyay, D Zuckerman
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
1602016
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
1541990
Computing with very weak random sources
A Srinivasan, D Zuckerman
SIAM Journal on Computing 28 (4), 1433-1459, 1999
1451999
Asymptotically good codes correcting insertions, deletions, and transpositions
LJ Schulman, D Zuckerman
IEEE transactions on information theory 45 (7), 2552-2557, 1999
1381999
General weak random sources
D Zuckerman
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990
1381990
Interaction in quantum communication
H Klauck, A Nayak, A Ta-Shma, D Zuckerman
IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007
118*2007
Another Proof That (and More)
O Goldreich, D Zuckerman
Studies in Complexity and Cryptography. Miscellanea on the Interplay between …, 2011
114*2011
Combinatorial bounds for list decoding
V Guruswami, J Hastad, M Sudan, D Zuckerman
IEEE Transactions on Information Theory 48 (5), 1021-1034, 2002
1112002
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20