members

The program is led by Avi Wigderson. Listed below are members and visitors who are taking an active part in this year's activities, along with their research interests.  Many members and visitors have personal homepages that provide more information on their research.

• Adi Akavia  (Complexity, Coding Theory)
• Noga Alon  (Combinatorics, Graph Theory, Theoretical Computer Science)
• Arkadev Chattopadhyay  (Algebraic Automata Theory, Computational Complexity, Discrete Mathematics)
• Xi Chen  (Game Theory, Complexity Theory)
• Zeev Dvir  (Algebraic Complexity, Randomness)
• Pavel Hrubes  (Logic, Proof Complexity)
• Russell Impagliazzo  (Computational Complexity)
• Gabor Kun  (Probabilistic Method, Expander Structures)
• Dana Moshkovitz  (Derandomization, Coding Theory)
• Anup Rao (Pseudorandomness, Complexity, Coding Theory, Combinatorics)
• Virginia Vassilevska  (Graph Theory and Algorithms)
• Ryan Williams  (Algorithms, Computational Complexity)
• Amir Yehudayoff  (Algebraic Circuits, Computational Complexity)