This program aims to foster interaction between theoreticians and practitioners to understand real-world efficient computation with a particular focus on the satisfiability problem for Boolean formulas.

Focusing on new developments in logic, automata, probabilistic modeling, games, and cyber-physical systems, this program aims to develop the theoretical foundations of computer systems.

This program brings together researchers in complexity theory, algorithms, statistics, learning theory, probability, and information theory to advance the methodology for reasoning about the computational complexity of statistical estimation problems.

This program aims to develop a geometric approach to various computational problems in sampling, optimization, and partial differential equations.

This program will bring together theoretical and applied researchers with the aim of understanding the complexity, optimization and approximation questions underlying causal inference and discovery.

By bringing together reseachers from machine learning, economics, operations research, theoretical computer science, and social computing, this program aims to advance the connections between learning theory, game theory and mechanism design.