The Institute typically hosts two concurrent programs per semester. Programs are selected with a view toward maximizing impact and engagement across the theoretical computer science community, as well as impact on neighboring scientific fields. A typical one-semester program is led by a small group of organizers who are recognized experts in their fields, and involves about 60–70 long-term participants (a mix of senior and junior researchers) who spend a month or longer at the Institute. A program usually includes three week-long topical workshops, each of which attracts an additional group of invited speakers and focuses on a different aspect of the program's scientific scope, as well as an initial boot camp designed to put long-term participants on the same page.
This program studies the interaction between logic and the algorithms that they inspire, with applications to databases, complexity theory, and knowledge representation.
This program will bring together researchers in dynamic graphs, sketching, and optimization towards the common goals of obtaining provably faster algorithms, finding new connections between the areas, and making new advances at their intersection....
The Simons Institute for the Theory of Computing offers numerous ways for scientists to participate in the life of the Institute.
- Applications for the Simons Quantum Postdoctoral Fellowships.
- Applications for Science Communicators in Residence for Summer 2022, Fall 2022, and Spring 2023.
This program will bring together researchers from computer science, physics, chemistry and mathematics to focus on the two grand challenges of quantum computation: developing the most promising algorithmic applications for quantum computers, and developing methods to test quantum devices.
This program will study fundamental questions on integer lattices and their important role in cryptography and quantum computation, bringing together researchers from number theory, algorithms, optimization, cryptography, and coding theory.
This program will focus on emerging connections between the analytic theory of multivariate polynomials (sometimes called "the geometry of polynomials") and theoretical computer science as well as related fields such as combinatorics, probability, statistical physics, optimization and real algebraic geometry.
The last decade has seen an emerging confluence of ideas from discrete and continuous optimization, leading to several significant breakthroughs. This program will bring together researchers from both the discrete and continuous optimization communities in order to stimulate further interaction at this interface.
This program aims to extend the reach and impact of CS theory within machine learning, by formalizing basic questions in developing areas of practice, advancing the algorithmic frontier of machine learning, and putting widely-used heuristics on a firm theoretical foundation.
Logic in computer science has long been associated with two main themes: the interaction of logic with algorithms and complexity theory, and the semantics of programs and processes. This program will bring together researchers from both ends of this spectrum, with the aim of bridging this decades-old divide.