August 16-18, 2026
Boston University, Boston, USA
https://www.local-algorithms.com/WOLA2026/

Local algorithms, that is, algorithms that compute and make decisions on parts of the output considering only a portion of the input, have been studied in a number of areas in theoretical computer science and mathematics. Some of these areas include sublinear-time algorithms, distributed algorithms, inference in large networks and graphical models. These communities have similar goals but a variety of approaches, techniques, and methods. This workshop (the 10th WoLA!) is aimed at fostering dialogue and cross-pollination of ideas between the various communities. To this end, the workshop will feature a small number of longer talks that, in part, survey approaches by various communities, as well as short, focused talks on recent, exciting results.

June 4-22, 2026
STOC 2026, Salt Lake City, Utah, USA, and Gather.Town
https://acm-stoc.org/stoc2026/call-for-posters.html

Submission deadline: June 12, 2026

As part of the STOC 2026 program, we will be hosting an online poster session from 18:30-19:30 MDT (GMT -6) on Monday, June 22, 2026 on the platform Gather.Town. Our hope is that people who cannot come in person to attend STOC can still join in the festivities for a while, either as presenters or participants.

Anyone with a paper accepted to either STOC 2026 or FOCS 2025 is invited to present a poster on this work. Aside from being a single page, static PDF, there are no restrictions on the poster format. During the session, presenters will “stand” by their virtual poster and answer questions from participants. Any author may present at the poster session, whether or not they are the live speaker and/or are attending STOC in person.

We warmly welcome all remote attendees interested in the poster session, regardless of whether they have a paper at either of the conferences. However, the posters will only feature papers from STOC 2026 and FOCS 2025. A link to the Gather.town arena will be shared on the webpage closer to the event.

June 27, 2026
STOC 2026, Salt Lake City, Utah, USA
https://pritishkamath.github.io/ai-tcs-stoc-2026/#about

Submission deadline: May 29, 2026

This workshop will explore the intersection of artificial intelligence and theoretical computer science. Through invited talks, a panel discussion and a poster session, we hope to foster a community-wide dialogue on whether and how AI can augment our current methodologies or redefine how we approach research in theoretical computer science.

Call for Posters
We invite submissions from researchers and practitioners across all backgrounds. Submissions can cover any TCS or math domain. If you are unsure whether your work fits the scope, we strongly encourage you to submit anyway!

Topics of interest include:

AI-assisted proof search and algorithm discovery

Agentic harnesses for accelerating research

Proof formalization (e.g., Lean, Rocq, Isabelle)

Effective human-AI collaboration

May 15-25, 2026
STOC 2026/TCS4All events
https://sigact.org/tcsforall/

Submission deadline: May 24, 2026

This year, TCS for All *Registration Scholarships* will cover the early registration cost at STOC 2026. The scholarships are intended for researchers at the beginning of their careers and they are being made available for all students in TCS. This scholarship is open to both US and international students. Preference will be given to students at the beginning of their studies. If we have sufficient funding, we will give awards to more senior students and possibly even postdocs. To apply, you will need to fill out the following form by Friday May 22 (11:59 pm PDT) in which you provide basic information about yourself:
.. In addition, you will need to have your advisor (or department head or other faculty mentor if you do not yet have an advisor) send a letter of support to tcswomen@gmail.com by May 24th(11:59 pm PDT). Your advisor’s letter should also describe the availability of other travel funds. Note for advisors: Specifics about alternative funding are very helpful. Statements like “funding is tight” are not very helpful. This letter should be sent with the subject line “support letter for [your name]”. This is very important. Your application is not complete without this letter.
Late applications (after May 22) will not be accepted. You will be notified about your status by June 1st, which is before the STOC early registration deadline.
Note: This registration award cannot be used in parallel to registration awards provided by other sources.

*TCS for All Spotlight Workshop Nomination*: We invite nomination for speakers in our TCS for All Rising Star talks at the TCS for All Spotlight Workshop at STOC 2026. To be eligible, your nominee has to be a senior PhD student with expected graduation no later than August 2026, or a postdoc in theoretical computer science (all topics represented at STOC are welcome), and not a speaker at a previous TCS4All Spotlight Workshop. Preference will be given to speakers who are currently on the job market for postdoctoral/faculty positions, or who expect to be on the job market in Fall 2026.
You can make your nomination by filling this form by Friday May 22 (11:59 pm PDT): https://docs.google.com/forms/d/e/1FAIpQLSfSe_AcitEA8JPm7mUyU83IpDrGRjPd0G6DIFVHmDDCLXplCQ/viewform

September 7-11, 2026
Cambridge, United Kingdom
https://www.newton.ac.uk/event/lfcw01/

Registration deadline: July 19, 2026

We are pleased to announce the workshop “Frontiers in Complexity Lower Bounds”, which will take place at the Isaac Newton Institute for Mathematical Sciences in Cambridge (UK) from 7 to 11 September 2026.

Many fundamental questions in complexity theory, such as the P vs NP problem, are about complexity lower bounds: proofs that computational problems cannot be solved within a given set of resources. This workshop will revisit the state of the art in complexity lower bounds, including recent work on lower bounds in weak models and new approaches to showing lower bounds for stronger models, as well as work on formulating and understanding various kinds of barriers to lower bounds.

Registration is required and closes on 19 July 2026. The registration form is available on the event website.

July 3, 2026
University of Warwick, UK
https://sites.google.com/view/algorithmscomplexitywarwick3/home

Registration deadline: May 31, 2026

The workshop Algorithms & Complexity @ Warwick will be held at the University of Warwick on July 3, 2026. The aim of the event is to highlight several recent exciting advances in the field of Algorithms and Complexity and to facilitate interactions within the research community. We hope that it will provide an excellent opportunity for Theory researchers – including academics, postdocs, and students – to connect and collaborate. Attendance is free, but registration is required to assist with local arrangements/catering. Please note that registration closes on 31 May. The online registration form is available on the website of the event. We hope to see many of you there!