Salil Vadhan
Gordon McKay Professor of
Computer Science and Applied
Mathematics
School of Engineering & Applied Sciences
Harvard University
I am a member of the Theory of
Computation research group.
My research areas include computational complexity, cryptography, and
randomness in computation.
On sabbatical at UC Berkeley until Summer `08, supported
by the Miller Institute and the Guggenheim Foundation.
- Research, papers, and talks.
- TCC 08 tutorial: Randomness Extractors & their
Cryptographic Applications.
- Visions for
Theoretical Computer Science Workshop.
- Courses & Lecture
Notes:
Pseudorandomness (CS225), taught Spring `02 & Spring `04, Spring `07.
Introduction to Cryptography (CS 120) (and its distance/extension version CSCI E-177), taught Fall `01, Spring `03, Fall `06. Next: ??
Introduction to Formal Systems and Computation (CS 121), taught Fall `04, Fall `05. Next: Fall `08.
Computational Complexity (CS 221), taught Fall `02, Spring `06. Next: Spring `08 (by Les Valiant).
Topics in the Theory of Computation (CS 229r), taught Spring `05. Next: ??
- Current Ph.D. students: Kai-Min Chung, Guy
Rothblum (MIT, co-advised with
Past Ph.D. students: Minh Nguyen (graduated Spr. `06), Emanuele Viola (graduated Spr `06), Shien Jin Ong (graduated Spr `07)
- Past postdocs: Eli Ben-Sasson (2001-2003), Dan Gutfreund (2005-2007), Alon Rosen (2005-2007)
· Some Professional Activities:
- SIGACT Committee for the Advancement of Theoretical Computer Science.
- Editor, SIAM Journal on Computing
- Editor, Computational Complexity
- Scientific Board, Electronic Colloquium on Computational Complexity.
- Conference Committee, Conference on Computational Complexity.
- Chair, 2003-04 Randomness and Computation research cluster at the Radcliffe Institute for Advanced Study
- Program
committees: STOC
`07, TCC `07
(chair), CRYPTO
`06, EUROCRYPT `05. TCC `04, RANDOM `02 (chair), FOCS `01, RANDOM `01, CCC
`01, CRYPTO `00.
- CV: [ps][pdf]
Research statement: [pdf]
Teaching statement: [pdf]