February 27, 2026
EnCORE, UC San Diego
https://cseweb.ucsd.edu/~slovett/workshops/socal-theory-day-2026/

After a long hiatus, the South California Theory Day is returning! This is an informal meeting for SoCal TCS researchers to meet and learn from each other. There will be a few long talks by senior researchers, and several shorter talks by students and postdocs. Attendance is free, but registration is required. For students/postdocs – please sign up to give a short talk.

The inaugural CCC Test of Time Award recognizes a paper published in CCC that had a significant and long-term impact on the field of computational complexity. Eligible papers are those that appeared in CCC (or Structures, for pre-1996 papers), at least 10 years ago. That is, from CCC 2016 or earlier.

We invite the community to nominate papers. The nomination deadline is March 2, 2026.
https://computationalcomplexity.org/tot/tot26.html

August 24 – December 18, 2026
Simons Institute, Berkeley CA
https://simons.berkeley.edu/programs/pseudorandomness-high-dimensional-expansion

Submission deadline: November 15, 2025

We are organizing a semester program on Pseudorandomness and High-Dimensional Expansion at the Simons Institute in Fall 2026 (in parallel with a program on Spectral Theory Beyond Graphs). Junior researchers (PhD after Summer 2021) can apply for a Simons Institute Research Fellowship (deadline Nov 15). We are nearly at capacity for long-term visitors, but there is an opportunity for interested researchers to apply for a small number of remaining slots allocated by the institute (deadline Nov 15).

Irit Dinur, Prahladh Harsha, Avishay Tal, Salil Vadhan, David Zuckerman

May 20-22, 2025
Dubai, UAE
https://sites.google.com/view/cyber-physical-systems/

Submission deadline: March 25, 2025
Registration deadline: April 14, 2025

This symposium is designed for researchers, academics, and industry leaders focused on advancing context-aware technologies in cyber-physical systems.

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).

June 24-28, 2024
Vancouver, BC
http://acm-stoc.org/stoc2024/index.html

STOC/TheoryFest 2024 is in Vancouver, British Columbia this year, during the week of June 24-28. The registration website is now open at http://acm-stoc.org/stoc2024/registration.html

In addition to the STOC 2024 paper talks, the program features keynote talks by Michal Feldman, Jakub Pachocki, and Tim Roughgarden, and workshops on Algorithmic Problems in Modern LLMs, Extremal Combinatorics, Length-Constrained Expanders, Online Resource Allocation, and a special workshop on TCS Mentoring, Diversity, and Outreach.

July 8-12, 2024
Budapest, Hungary
https://conferences.renyi.hu/summit280/home

Submission deadline: March 31, 2024
Registration deadline: May 15, 2024

In 2024, Péter Frankl, Zoltán Füredi, Ervin Győri and János Pach will turn 70. On the occasion of this joyful event, we organize a conference Sum(m)it280. We would like to invite you to celebrate these four Hungarian combinatorialists with us. List of invited speakers: Noga Alon, Maria Axenovich, Jacob Fox, Balázs Keszegh, Younjin Kim, Alexandr Kostochka, Andrey Kupavskii, László Lovász, Abhishek Methuku, Géza Tóth, Jacques Verstraete, Jian Wang

January 20, 2024 – December 20, 2025
UCSD
https://encore.ucsd.edu/encore-visitors-program/

The Institute for Emerging CORE Methods in Data Science (EnCORE) welcomes proposals for extended research visits between 2024-2025. Each extended research visit proposal needs to identify 3-5 researchers who will be spending 2-4 weeks at the institute working on their proposed research theme.

Foundational questions in all areas of Computer Science, Data Science, and AI are within scope. A proposal may aim to solve long-standing open questions in an established area or identify new theoretical directions in an emerging application area, or enable bridging between theory and practice among others. Moreover, each team will be organizing a workshop (3 to 5 days) during their stay at UCSD related to the research theme, bringing in additional participants (up to 20 including the organizers) to facilitate further dialogues. Proposals from industry are welcome and encouraged.

Please submit your proposal in .pdf format. Include a title, and a brief description (maximum 2 pages) detailing the research topic and why a particular knowledge gap should be addressed. Each proposal should also include a 1-2 paragraph description of the proposed workshop and a tentative list of participants.

Each member of the organizing research team will be reimbursed their actual living expenses at San Diego up to $1000 per week, or they can receive a fixed stipend (subject to applicable taxes) in lieu of actual expenses. In addition, a fixed funding will be available for each workshop. The EnCORE institute will provide suitable collaboration space, offices for the team members, and open-style seminar room to host workshops with all necessary facilities free of charge.

The proposal will be evaluated based on its intellectual merit and broader impact with careful consideration given to the teams that uphold diversity and equity along with their potential to collaborate with existing UCSD faculty. Upon the end of each extended visit, the team will submit an intermediate report elaborating the outcome, and a one-year anniversary report delineating subsequent developments.

January 8-9, 2024
Alexandria, VA
https://www.siam.org/conferences/cm/conference/sosa24

Submission deadline: August 10, 2023

The 7th Symposium on Simplicity in Algorithms will be co-located with SODA 2024, in Alexandria, VA. 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. Paper registration by August 10, submission by August 17, 2023.

October 17-21, 2022
Guanajuato, Mexico
https://delta.cs.cinvestav.mx/~francisco/Latin22/

Submission deadline: May 22, 2022

LATIN is devoted to different areas in theoretical computer science including, but not limited to: algorithms (approximation, online, randomized, algorithmic game
theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory,
computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, foundations of data science and theoretical machine learning, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, quantum computing, and random structures.