With daughter Emma. hi-res |
|
| Fall, 2008: | Randomized Algorithms (CS 388R), a graduate course. | Spring, 2008: | Theory of Computation (CS 353), an undergraduate 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 Brief Biography C.V. |
| Talks: | The Power of Randomness in Computation,
given first at the
Radcliffe Institute,
aimed at non-scientists. Research overview talk for CS 398T Some invited talks |
| Professional Activities: |
Conference on Computational Complexity 2008
(program committee) SIAM Journal on Discrete Mathematics (editor) Theory of Computing (editor) ACM Transactions on Computation Theory (editor) |
| People: |
Algorithms and Computational Theory group
Current PhD students: Xin Li, Raghu Meka Former PhD students: Jesse Kamp, Anindya Patthak, Anup Rao Former postdocs: Tugkan Batu, Alex Russell, Amnon Ta-Shma Brother: Daniel Zuckerman |
