David Zuckerman
David Zuckerman
Professor of Computer Science, University of Texas at Austin
Verified email at cs.utexas.edu - Homepage
TitleCited byYear
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
7812006
Randomness is linear in space
N Nisan, D Zuckerman
Journal of Computer and System Sciences 52 (1), 43-52, 1996
698*1996
Optimal speedup of Las Vegas algorithms
M Luby, A Sinclair, D Zuckerman
Information Processing Letters 47 (4), 173-180, 1993
5071993
An XOR-based erasure-resilient coding scheme
J Bloemer, M Kalfane, R Karp, M Karpinski, M Luby, D Zuckerman
5001995
How to recycle random bits
R Impagliazzo, D Zuckerman
30th Annual Symposium on Foundations of Computer Science, 248-253, 1989
4161989
Simulating BPP using a general weak random source
D Zuckerman
Algorithmica 16 (4-5), 367-391, 1996
232*1996
On unapproximable versions of NP-complete problems
D Zuckerman
SIAM Journal on Computing 25 (6), 1293-1304, 1996
228*1996
Randomness‐optimal oblivious sampling
D Zuckerman
Random Structures & Algorithms 11 (4), 345-367, 1997
219*1997
Lossless condensers, unbalanced expanders, and extractors
A Ta-Shma, C Umans, D Zuckerman
Combinatorica 27 (2), 213-240, 2007
173*2007
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography
J Kamp, D Zuckerman
SIAM Journal on Computing 36 (5), 1231-1247, 2006
1662006
Expanders that beat the eigenvalue bound: Explicit construction and applications
A Wigderson, D Zuckerman
Combinatorica 19 (1), 125-138, 1999
163*1999
Derandomized graph products
N Alon, U Feige, A Wigderson, D Zuckerman
Computational Complexity 5 (1), 60-75, 1995
1571995
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
1441990
Computing with very weak random sources
A Srinivasan, D Zuckerman
SIAM Journal on Computing 28 (4), 1433-1459, 1999
1401999
General weak random sources
D Zuckerman
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990
1341990
Asymptotically good codes correcting insertions, deletions, and transpositions
LJ Schulman, D Zuckerman
IEEE transactions on information theory 45 (7), 2552-2557, 1999
1121999
Interaction in quantum communication
H Klauck, A Nayak, A Ta-Shma, D Zuckerman
IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007
107*2007
Explicit two-source extractors and resilient functions
E Chattopadhyay, D Zuckerman
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
1002016
Tight analyses of two local load balancing algorithms
B Ghosh, FT Leighton, BM Maggs, S Muthukrishnan, CG Plaxton, ...
SIAM Journal on Computing 29 (1), 29-64, 1999
97*1999
Extractors from Reed–Muller codes
A Ta-Shma, D Zuckerman, S Safra
Journal of Computer and System Sciences 72 (5), 786-812, 2006
952006
The system can't perform the operation now. Try again later.
Articles 1–20