Since 1989, I have organized
workshops related to complexity theory at Bellairs Research Institute of
McGill University in Holetown, St. James, Barbados. Every winter, a small
selected group of senior researchers and graduate students is invited to
spend a week at Bellairs Institute to hear a series of lectures on a selected
topic and discuss open problems in the area. These workshops have always been
quite successful and much international research collaboration has originated
in these meetings. Here is a list of the topics and guest lecturers
over the years:
- 1989 : Circuit Complexity
- 1990 : Circuit Complexity (M. Sipser, MIT)
- 1991 : Logic and Complexity (P. Clote, Boston College)
- 1992 : Circuit Lower Bounds : the polynomial method (R. Beigel, Yale University)
- 1993 : Communication Complexity (N. Nisan, Hebrew University of Jerusalem)
- 1994 : Derandomization and Universal Hashing
(A. Widgerson, Hebrew University of Jerusalem)
(Lecture Notes)
- 1995 : Proof Theory and Complexity
(S. Buss, UCSD)
(Lecture Notes)
- 1996 :
Around the PCP Theorem (S. Arora, Princeton
University)
(Lecture
Notes)
- 1997 : Cellular Automata
- 1998 : Randomness in Complexity (S. Rudich, Carnegie-Mellon)
- 1999 : Learning (M. Kearns, AT&T)
- 2000 : Fourier Transforms in Computer Science (U. Vazirani, Berkeley)
- 2001 : Extractors and Randomness (L. Trevisan, Berkeley)
- 2002 : Selected topics
- 2003 : Constraint Satisfaction,
Complexity, and Logic (Phokion G. Kolaitis, UCSC)
- 2004 : Finite metric spaces and low dimensional
embeddings
(Nati Linial, Hebrew University of Jerusalem)
(Lecture Notes)
- 2005 :
Lower Bounds for Algebraic Circuits (Ran Raz,
Weizmann Institute)
(Lecture notes)
- 2006 :
Error-correcting
codes and Computational Complexity
(Madhu Sudan, MIT)
(Lecture notes)
- 2007 :
Rings and Integer Lattices in Computer Science
(Manindra Agrawal, IIT Kanpur)
(Lecture notes)
- 2008 :
Elliptic Curves
(Renée Schoof, Università di Roma "Tor Vergata")
(Lecture notes)
- 2009 :
Data Stream Algorithms
(S. Muthu Muthukrishnan)
(Lecture notes)
- 2010 :
Additive Combinatorics and Group Representation
(Ben Green, Avi Wigderson)
(Lecture notes)
- 2011 :
Information Theory in Computational Complexity and Discrete Mathematics
(Michael Saks)
- 2012 :
Analysis of Boolean Functions
(Ryan O'Donnell)
(Lecture notes)
- 2013 :
Lattices and Lattice-Based Cryptography
(Oded Regev)
- 2014 :
Differential Privacy
(Salil Vadhan)
(Lecture notes)
- 2015 :
Information, Communication Complexity, and Interactive Coding
(Mark Braverman)
- 2016 :
The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes
(Scott Aaronson)
(Lecture notes)
- 2017 :
Complexity in Economics and Game Theory
(Tim Roughgarden)
(Lecture notes)
- 2018 :
Tools from Additive Combinatorics
(Timothy Gowers)
- 2019 :
Generalization in Deep Learning (Sanjeev Arora)
- 2022 :
Causal Representation Learning
(Elias Bareinboim et al.)
Related Links
