David Zuckerman

Professor
Email: diz@cs.utexas.edu
Office:GDC 4.508
Postal: Department of Computer Science
University of Texas at Austin
2317 Speedway, Stop D9500
Austin, Texas 78712

Research

Publications: Most publications are available on-line. Also choose by topic: randomness extractors and applications; other pseudorandomness and explicit constructions; coding theory; complexity 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, aimed at a general audience.
Research overview talk for CS 398T
Some invited talks
People: Prospective students and interns: Please read before emailing me.
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 2014: Theory of Computation (CS 353), an undergraduate course.
Fall 2014: Coding Theory (CS 395T), a graduate course.
Spring 2014: Combinatorics and Graph Theory (CS 388C), a graduate course.
Spring 2013: Algorithms and Complexity (CS 378), a required undergraduate course.
Fall 2009: Pseudorandomness (CS 395T), a graduate seminar.
Fall 2008: Randomized Algorithms (CS 388R), 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 8, 2013