August 15-17, 2025
Chengdu, China
https://tcsuestc.com/cocoon2025/index.html
Submission deadline: March 5, 2025
Aggregator for CS theory workshops, schools, and so on
August 15-17, 2025
Chengdu, China
https://tcsuestc.com/cocoon2025/index.html
Submission deadline: March 5, 2025
June 11-13, 2025
Otzenhausen
https://algo.uni-trier.de/wg2025/
Submission deadline: February 14, 2025
WG conferences aim to connect theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. This conference series has a long tradition and bridges discrete mathematics and computer science. WG is mainly concerned with efficient algorithms of various types (e.g., sequential, parallel, distributed, randomized, parameterized) for problems on graphs and networks. The goal is to present recent results and to identify and explore directions for future research.
June 3-6, 2025
Simons Institute, Berkeley, CA
https://womenintheory.wordpress.com/
Submission deadline: January 31, 2025
The Women in Theory (WIT) Workshop is intended for graduate and exceptional undergraduate students in the area of theory of computer science. The workshop will feature technical talks and tutorials by senior and junior women in the field, as well as social events and activities. The motivation for the workshop is twofold. The first goal is to deliver an invigorating educational program; the second is to bring together theory women students from different departments and foster a sense of kinship and camaraderie.
December 5-6, 2024
Northwestern University (Mudd 3514) & TTIC
https://theory.cs.northwestern.edu/junior-theorists-workshop-2024/
Chicago Junior Theorists Workshop 2024 is being held jointly by Northwestern University and Toyota Technological Institute at Chicago on Dec 5 – Dec 6. The focus of this workshop will be on junior researchers in all areas of theoretical computer science. The workshop will take place at Northwestern University on Thursday, Dec 5, and Toyota Technological Institute at Chicago on Friday, Dec 6. This workshop will be in-person. Registration is free, and the registration form can be found on the event webpage.
The workshop is held in conjunction with the NSF All-TRIPODS workshop on the foundations of data science at TTIC and organized by the NSF-funded IDEAL institute on Dec 6 – Dec 7, 2024.
October 5-6, 2024
University at Buffalo, Buffalo, NY
https://www.cs.rochester.edu/u/shossei2/eagl2024website/index.html
Registration deadline: September 15, 2024
This regional theory workshop features talks by distinguished scientists and a student poster session.
All interested in theoretical computer science are welcome to attend. Registration is required.
August 29, 2024
London School of Economics, London, UK
https://approxrandom2024.site/
RANDOM-APPROX 2024 will include a session in memory of Luca Trevisan consisting of a few short talks highlighting Luca’s contributions to pseudorandomness and hardness of approximation, organized by Dieter van Melkebeek. The speakers will be Anupam Gupta (on unique games), Jelani Nelson (on approximation algorithms), Rocco Servedio (on pseudorandomness) and Dieter van Melkebeek ( on randomness extraction).
January 13-14, 2025
New Orleans, Louisiana, U.S.
https://siam.org/conferences-events/siam-conferences/sosa25/
Short Abstract Submission and Paper Registration: August 5, 11:59pm Anywhere on Earth. Submissions received after this time will not be considered. Full Paper Submission: August 8, 11:59 p.m. Anywhere on Earth. Papers in all areas of algorithms research are sought. An ideal submission will advance our understanding of an algorithmic problem by, for example, introducing a simpler algorithm, presenting a simpler analysis of an existing algorithm, or offering insights that generally simplify our understanding of important algorithms or computational problems. We are especially interested in papers that make material more accessible to a wider audience, such as undergraduates, or for more specialized topics, general algorithms researchers. Submissions should contain novel ideas or attractive insights, but they are not required to prove novel theorems. That is, the results themselves can be known, but their presentation must be new.
October 7-9, 2024
Simons Institute for the Theory of Computing, Berkeley, CA, USA https://simons.berkeley.edu/homepage
There will be a workshop at the Simons Institute in Berkeley in celebration of the life and scientific contributions of the late Luca Trevisan (1971-2024). The workshop will be open to all who would like to attend, subject to capacity constraints. Stay tuned for registration information when it is available.
July 25 – August 31, 2024
Chicago, IL
https://focs.computer.org/2024/call-for-workshops/
Submission deadline: August 22, 2024
We invite proposals for five hour workshops to be held on the first day of FOCS 2024 (Oct 27 2024) to be held in Chicago. The proposal are supposed to be short (two pages max) and describe a plan for talks on a timely topic. See https://focs.computer.org/2024/call-for-workshops/ for details.
August 19-21, 2024
Toyota Technological Institute at Chicago (TTIC)
https://samsonzhou.github.io/ttic-2024-workshop-learning-augmented.html
Submission deadline: August 12, 2024
Registration deadline: August 15, 2024
The workshop will focus on both the fundamental aspects of designing learning-augmented algorithms (also known as algorithms with predictions), as well as its applications in areas such as approximation algorithms, data structure, graph algorithms, randomized numerical linear algebra, online algorithms, streaming and sketching algorithms, and supervised and unsupervised learning. The invited participants span a diverse set of research areas from both academia and industry, including theoretical computer science, machine learning, and operations research.
*Call for Poster and Lightning Talk presentation*: We will be holding sessions for poster and lightning talks. If you are interested in presenting a poster or giving a lightning talk, please indicate your interest and preference in the registration form. While we aim to accommodate all submissions, we may have to limit the number of presentations due to time and space constraints.