Button to scroll to the top of the page.

David I Zuckerman

Department of Computer Science

Professorship in Computer Sciences #1

Theoretical Computer Science


Phone: 512-471-9729

Office Location
GDC 4.508

Postal Address
AUSTIN, TX 78712

Ph.D., University of California at Berkeley (1991)
A.B., Harvard University (1987)

Research Interests 

Dr. Zuckerman does research in the role of randomness in computation. In particular, much of his research has focused on randomness extraction, pseudorandomness, coding theory, cryptography, and other aspects of complexity theory.

Selected Publications
R. Meka and D. Zuckerman, Pseudorandom generators for polynomial threshold functions, 42nd Annual ACM Symposium on Theory of Computing (STOC), 2010, pp. 427-436. Invited to special SICOMP issue on STOC 2010.

D. Zuckerman, Linear degree extractors and the inapproximability of Max Clique and Chromatic Number, Theory of Computing, 3 (2007): 103-128. Preliminary version in STOC 2006.

D. Zuckerman, Randomness-optimal oblivious sampling, Random Structures & Algorithms, 11 (1997): 345-367. Preliminary version in STOC 1996.

N. Nisan and D. Zuckerman, Randomness is linear in space, Journal of Computer and System Sciences, 52 (1996): 43-52. Special issue on STOC 1993.

D. Zuckerman, Simulating BPP using a general weak random source, Algorithmica, 16 (1996): 367-391. Preliminary version in FOCS 1991.

  • John S. Guggenheim Memorial Foundation Fellowship, 2004-05
  • Radcliffe Institute for Advanced Study Fellowship, 2004-05
  • David and Lucile Packard Fellowship for Science and Engineering, 1996-2006
  • Alfred P. Sloan Research Fellowship, 1996-2000
  • NSF Young Investigator Award, 1994-2000
  • Machtey Award (Best Student Paper Award), FOCS 1990
  • Putnam Fellow (William Lowell Putnam Mathematical Competition co-winner), 1986