TCS for All Spotlight Workshop at STOC 2026: Conference registration grants and call for speaker nominations

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

Workshop “Frontiers in Complexity Lower Bounds”

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.

Groups, Expanders and Codes – Celebrating the 70’s birthday of Alex Lubotzky

June 14-18, 2026
Hebrew University, Israel
https://iias.huji.ac.il/event/25th-midrasha-mathematicae-groups-expanders-and-codes

In the past few years, there has been several exciting developments at the confluence of pure mathematics and theoretical computer science. These include:

The refutations of Connes’ embedding problem and the Aldous–Lyons conjecture using tools from group stability, complexity theory and quantum information theory.
The construction of good locally testable codes and good quantum LDPC codes, using breakthroughs in high dimensional expansion.
This conference is devoted to these results and the theory surrounding them, and will celebrate the 70’s birthday of Alex Lubotzky, whose contributions range from establishing the very foundations of these fields, to the most recent breakthroughs.

Workshops, Tutorials, and Community Events at COLT 2026

June 29 – July 3, 2026
San Diego, USA
https://learningtheory.org/colt2026/workshops.html#cfp

Submission deadline: May 7, 2026

The Conference on Learning Theory (COLT 2026) will dedicate the first day of the main conference program (June 29 – July 3) to contributed and invited workshops, tutorials, and community events (e.g., affinity workshops, mentoring activities, socials). We invite proposals for these in-person events: please submit your proposal submit by email by May 7th AoE (see the call for more details).

Algorithms and Complexity Workshop @ Warwick

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!

APPROX 2026 Call for Papers

April 16 – May 7, 2026
Boston University, Boston
https://approxconference.com/)

Submission deadline: May 6, 2026

Dear researchers,

The 29th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2026) will be held at Boston University, Boston, Massachusetts, USA, on August 19-21, 2026 (together with RANDOM 2026 and WOLA 2026).

The deadline to submit your papers for APPROX 2026 is May 6, 2026 (Anywhere on Earth). You can find more details and the call for papers on the website (https://approxconference.com/).

RANDOM 2026 Call For Papers

August 19-21, 2026
Boston University
https://randomconference.com/random-2026-home/

Submission deadline: May 6, 2026

The 30th International Conference on Randomization and Computation (RANDOM 2026) will be held at Boston University, Boston, Massachusetts, USA, on August 19-21, 2026 (together with APPROX 2026 and WOLA 2026). The deadline to submit your papers for RANDOM 2026 is May 6, 2026 (Anywhere on Earth). You can find more details and the call for papers on our website.

2nd Quantum Cambridge-Oxford-Warwick Colloquium (QCOW)

April 23-24, 2026
University of Warwick
https://qcow.cs.ox.ac.uk/

QCOW is a new series of meetings dedicated to advancing the understanding of fundamental questions and open problems in quantum complexity theory. The meetings will rotate between universities of Cambridge, Oxford, and Warwick, with each event focusing on a specific theme within the theoretical foundations of quantum computation. The aim is to foster a sustained exchange of ideas among researchers in the field—bringing together leading experts, academics and postdoctoral scholars, and students who share a deep interest in the rigorous study of quantum computational power and its limitations. By providing a forum for in-depth discussion and collaboration, the QCOW Colloquium seeks to strengthen and expand the community of researchers working on quantum computing theory, stimulate new research directions, and inspire the next generation of scientists in this rapidly evolving discipline. The topic of QCOW2 will be Quantum Learning Theory.

9th Workshop on Algebraic Complexity Theory

June 2-5, 2026
University of Copenhagen
https://sites.google.com/view/wact2026/

Registration deadline: February 28, 2026

Algebraic Complexity Theory investigates the computational complexity of algebraic problems, focusing on arithmetic circuits, polynomial computation, and algebraic models of computation. The goal of this workshop is to present recent advances in the field of algebraic complexity and to highlight the deep underlying connections to other areas of theoretical computer science. Registration for this workshop is free but mandatory.

Information Theory in Modern Science 2026

July 6-10, 2026
Okinawa, Japan
https://www.oist.jp/conference/information-theory-modern-science

Submission deadline: May 17, 2026
Registration deadline: June 15, 2026

We are excited to announce the opening of registration for the Information Theory in Modern Science (ITMS) Workshop, hosted at the Okinawa Institute of Science and Technology (OIST), Japan

This workshop brings together researchers from information theory, probability, statistics, machine learning, and the natural sciences, focusing on how information-theoretic ideas are shaping modern scientific questions.