David Zuckerman

Professor
Department of Computer Science
University of Texas at Austin
diz@cs.utexas.edu
On sabbatical at the Institute for Advanced Study from September 2011 - August 2012.
My postal address there:
School of Mathematics
Institute for Advanced Study
Einstein Drive
Princeton, NJ 08540

Research

Publications: Most publications are available on-line. Also choose by topic: randomness extractors and applications; other pseudorandomness and explicit constructions; coding theory and compression; distributed computing, cryptography, and security; inapproximability; random walks on graphs; finance; randomized algorithms and quantum computing; expository.
Overview/Bio Non-technical research summary
Can Random Coin Flips Speed Up a Computer?, an essay targeting a general audience.
Brief Biography
C.V.
Talks: The Power of Randomness in Computation, given first at the Radcliffe Institute, aimed at a general audience.
Research overview talk for CS 398T
Some invited talks
Editorial Boards: Theory of Computing
ACM Transactions on Computation Theory
People: Current PhD student: Abhishek Bhowmick
Former students: Xin Li (PhD, 2011), Raghu Meka (PhD, 2011), Jesse Kamp (PhD, 2007), Anindya Patthak (PhD, 2007), Anup Rao (PhD, 2007)
Former postdocs: Mahdi Cheraghchi (2010-11), Ariel Gabizon (2010), Tugkan Batu (2003-04), Amnon Ta-Shma (1999-2000), Alex Russell (1997-99)
Algorithms and Computational Theory group
Brother: Daniel Zuckerman

Teaching


Fall, 2012: Coding Theory (CS 395T), a graduate course.
Spring, 2011: Theory of Computation (CS 353), an undergraduate course.
Fall, 2009: Pseudorandomness (CS 395T), a graduate seminar.
Fall, 2008: Randomized Algorithms (CS 388R), a graduate course.
Fall, 2007: Combinatorics and Graph Theory (CS 388C), a graduate course.
Spring, 2004: Polynomials and Computation (CS 395T), a graduate seminar.
Lecture Notes: Pseudorandomness and Combinatorial Constructions (CS 395T), a graduate-level introduction to my research area (2001).
Last modified: April 10, 2012