Participants
The program is led by Avi Wigderson. This page lists members and visitors that take an active part in this year's activities.
Members and Visitors
(people who are in residence for at least one term; the name is followed by a brief description of research interests, and personal home pages provide more information).
- Nir Ailon (Algorithms, Optimization)
- Allan Borodin (Complexity Theory) spring term only
- Julia Chuzhoy (Approximation)
- Tali Kaufman (Algorithms) spring term only
- Neeraj Kayal (Computational Complexity)
- Jonathan Kelner (Theoretical Computer Science)
- Alexander Razborov (Computational Complexity, Proof Complexity, Combinatorics)
- Aaron Siegel (Combinatorial Game Theory)
- Vladimir Trifonov (Theoretical Computer Science)
- Emanuele Viola (Computational Complexity Theory)
Short-Term Visitors
- Michel Goemans, MIT (09/25 - 09/26/06)
- Anup Rao, University of Texas at Austin (10/30 - 11/10/06)
- Elwyn Berlekamp, University of California at Berkeley (11/12 - 11/15/06)
- Sergey Yekhanin, MIT (11/25 - 11/28/06)
- Alexander Gamburd, University of California at Santa Cruz (12/01 - 12/31/06)
- Silvio Micali, MIT (12/04 - 12/04/06)
- Xi Chen, Tsinghua University (12/17 - 12/19/06)
- Andrew Klapper, University of Kentucky (02/01 - 03/31/07)
- Michael Krivelevich, Tel-Aviv University (02/11 - 02/12/07)
- Christos Papadimitriou, University of California at Berkeley (04/07 - 04/15/07)
National Science Foundation
State of New Jersey
