Past Workshops & Symposia

Algorithmic Advances for Statistical Inference with Combinatorial Structure
Monday, Oct. 11–Friday, Oct. 15, 2021
Program: Computational Complexity of Statistical Inference

Organizers:

Laurent Massoulie (Microsoft Research-INRIA Joint Centre; chair), Po-Ling Loh (University of Wisconsin, Madison), Jiaming Xu (Duke University)
Sampling Algorithms and Geometries on Probability Distributions
Monday, Sep. 27–Friday, Oct. 1, 2021
Program: Geometric Methods in Optimization and Sampling

Organizers:

Jelena Diakonikolas (University of Wisconsin-Madison), Philippe Rigollet (MIT), Santosh Vempala (Georgia Institute of Technology)
Rigorous Evidence for Information-Computation Trade-offs
Monday, Sep. 13–Friday, Sep. 17, 2021
Program: Computational Complexity of Statistical Inference

Organizers:

Sam Hopkins (UC Berkeley; Microsoft Research Fellow; co-chair), Lenka Zdeborová (École polytechnique fédérale de Lausanne; co-chair), Afonso Bandeira (ETH Zürich)
Geometric Methods in Optimization and Sampling Boot Camp
Monday, Aug. 30–Friday, Sep. 3, 2021
Program: Geometric Methods in Optimization and Sampling

Organizers:

Philippe Rigollet (MIT; chair), Katy Craig (UC Santa Barbara), Simone Di Marino (Università di Genova), Nisheeth Vishnoi (Yale University), Martin Wainwright (UC Berkeley), Ashia Wilson (MIT)
Computational Complexity of Statistical Inference Boot Camp
Monday, Aug. 23–Friday, Aug. 27, 2021
Program: Computational Complexity of Statistical Inference

Organizers:

Guy Bresler (MIT; chair), Adam Klivans (University of Texas, Austin), Gábor Lugosi (Pompeu Fabra University), Ankur Moitra (Massachusetts Institute of Technology), Prasad Raghavendra (UC Berkeley), Tselil Schramm (Stanford University), Yihong Wu (Yale University)
Quantum Wave in Computing Reunion
Monday, Jul. 12–Friday, Jul. 16, 2021
Program: The Quantum Wave in Computing

Organizers:

Andrew Childs (University of Maryland), Ignacio Cirac (Max-Planck-Institut für Quantenoptik), Umesh Vazirani (UC Berkeley), Thomas Vidick (California Institute of Technology)
Lattices: Algorithms, Complexity, and Cryptography Reunion
Monday, Jun. 14–Wednesday, Jun. 16, 2021
Program: Lattices: Algorithms, Complexity, and Cryptography

Organizers:

Shafi Goldwasser (UC Berkeley; co-chair), Vinod Vaikuntanathan (Massachusetts Institute of Technology; co-chair), Daniele Micciancio (UC San Diego), Oded Regev (Courant Institute, NYU)
Games and Equilibria in System Design and Analysis
Friday, May 14, 2021
Program: Theoretical Foundations of Computer Systems

Organizers:

Rajeev Alur (University of Pennsylvania), Pavol Černý (TU Wien), Rupak Majumdar (Max Planck Institute for Software Systems; International Computer Science Institute), Michael Wooldridge (University of Oxford)
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Thursday, May 13, 2021
Program: Satisfiability: Theory, Practice, and Beyond

Organizers:

Albert Atserias (Universitat Politècnica de Catalunya; co-chair), Sam Buss (UC San Diego; co-chair), Paul Beame (University of Washington), Matti Järvisalo (University of Helsinki), Mohan Paturi (UC San Diego), Toni Pitassi (University of Toronto), Neil Thapen (Czech Academy of Sciences)
Theoretical Foundations of SAT/SMT Solving
Wednesday, May 12, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond

Organizers:

Antonina Kolokolova (Memorial University of Newfoundland; co-chair), Moshe Vardi (Rice University; co-chair), María Luisa Bonet Carbonell (Universitat Politecnica de Catalunya), Vijay Ganesh (University of Waterloo), Marijn Heule (Carnegie Mellon University), Kevin Leyton-Brown (University of British Columbia)
Beyond Satisfiability
Tuesday, May 11, 2021
Program: Satisfiability: Theory, Practice, and Beyond

Organizers:

Jakob Nordström (University of Copenhagen & Lund University; chair), Nikolaj Bjorner (Microsoft Research), Adnan Darwiche (UC Los Angeles), Ambros Gleixner (Zuse Institute Berlin), Kuldeep Singh Meel (National University of Singapore), Martina Seidl (Johannes Kepler University Linz)
Synthesis of Models and Systems
Monday, May 10, 2021
Program: Theoretical Foundations of Computer Systems

Organizers:

Radu Grosu (TU Wien), Ras Bodik (University of Washington), Ruzica Piskac (Yale University), Sanjit Seshia (UC Berkeley)
Games and Equilibria in System Design and Analysis
Friday, May 7, 2021
Program: Theoretical Foundations of Computer Systems

Organizers:

Rajeev Alur (University of Pennsylvania), Pavol Černý (TU Wien), Rupak Majumdar (Max Planck Institute for Software Systems; International Computer Science Institute), Michael Wooldridge (University of Oxford)
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Thursday, May 6, 2021
Program: Satisfiability: Theory, Practice, and Beyond

Organizers:

Albert Atserias (Universitat Politècnica de Catalunya; co-chair), Sam Buss (UC San Diego; co-chair), Paul Beame (University of Washington), Matti Järvisalo (University of Helsinki), Mohan Paturi (UC San Diego), Toni Pitassi (University of Toronto), Neil Thapen (Czech Academy of Sciences)
Theoretical Foundations of SAT/SMT Solving
Wednesday, May 5, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond

Organizers:

Antonina Kolokolova (Memorial University of Newfoundland; co-chair), Moshe Vardi (Rice University; co-chair), María Luisa Bonet Carbonell (Universitat Politecnica de Catalunya), Vijay Ganesh (University of Waterloo), Marijn Heule (Carnegie Mellon University), Kevin Leyton-Brown (University of British Columbia)
Beyond Satisfiability
Tuesday, May 4, 2021
Program: Satisfiability: Theory, Practice, and Beyond

Organizers:

Jakob Nordström (University of Copenhagen & Lund University; chair), Nikolaj Bjorner (Microsoft Research), Adnan Darwiche (UC Los Angeles), Ambros Gleixner (Zuse Institute Berlin), Kuldeep Singh Meel (National University of Singapore), Martina Seidl (Johannes Kepler University Linz)
Synthesis of Models and Systems
Monday, May 3, 2021
Program: Theoretical Foundations of Computer Systems

Organizers:

Radu Grosu (TU Wien), Ras Bodik (University of Washington), Ruzica Piskac (Yale University), Sanjit Seshia (UC Berkeley)
Games and Equilibria in System Design and Analysis
Friday, Apr. 30, 2021
Program: Theoretical Foundations of Computer Systems

Organizers:

Rajeev Alur (University of Pennsylvania), Pavol Černý (TU Wien), Rupak Majumdar (Max Planck Institute for Software Systems; International Computer Science Institute), Michael Wooldridge (University of Oxford)
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Thursday, Apr. 29, 2021
Program: Satisfiability: Theory, Practice, and Beyond

Organizers:

Albert Atserias (Universitat Politècnica de Catalunya; co-chair), Sam Buss (UC San Diego; co-chair), Paul Beame (University of Washington), Matti Järvisalo (University of Helsinki), Mohan Paturi (UC San Diego), Toni Pitassi (University of Toronto), Neil Thapen (Czech Academy of Sciences)
Theoretical Foundations of SAT/SMT Solving
Wednesday, Apr. 28, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond

Organizers:

Antonina Kolokolova (Memorial University of Newfoundland; co-chair), Moshe Vardi (Rice University; co-chair), María Luisa Bonet Carbonell (Universitat Politecnica de Catalunya), Vijay Ganesh (University of Waterloo), Marijn Heule (Carnegie Mellon University), Kevin Leyton-Brown (University of British Columbia)

Pages