With daughter Emma. hi-res |
|
| Spring, 2010: | 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). |
| 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; other topics. |
| 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 students:
Allison Lewko (co-advised by
Brent Waters),
Xin Li,
Raghu Meka
Former PhD students: Jesse Kamp, Anindya Patthak, Anup Rao Former postdocs: Tugkan Batu, Alex Russell, Amnon Ta-Shma Algorithms and Computational Theory group Brother: Daniel Zuckerman |
