2011-2012 Members

Participants

    The program is led by Avi Wigderson. This page lists members and visitors who take an active part in this year's activities.

Members

Members 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.

• Noga Alon, Visiting Professor  (Combinatorics)
• Russell Impagliazzo, Visiting Professor  (Computational Complexity)
  
• László Lovász, Visiting Professor  (Combinatorial Optimiation, Graph Theory)
• Shachar Lovett  (Computer Science)
• Raghu Meka  (Pseudorandomness, Complexity Theory, Learning Theory, Probability)
• Ankur Moitra   (Approximation Algorithms and Learning Theory)
• Shubhangi Saraf   (Complexity Theory and Sublinear-time Algorithms)
• Balázs Szegedy   (Limits of Discrete Structures and Higher Order Fourier Analysis)
• Katalin Vesztergombi   (Combinatorics)
• David Zuckerman   (Pseudorandomness)

   

Visitors

• Oded Goldreich  (Theory of Computation)
  
• Swastik Kopparty  (Coding Theory, Complexity Theory, Pseudorandomness)
• Jelani Nelson   (Theoretical Computer Science)
• Grant Schoenebeck   (Complexity Theory, Intersection of Comuter Science)
• Nikhil Srivastava  (Theoretical Computer Science)