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.

Annual Summer School on Mathematical Aspects of Data Science

June 22 – July 1, 2026
Singapore
https://ims.nus.edu.sg/events/ma_datascience2026/

This is a summer school targeted primarily at PhD students (and also open to others such as Masters and post-docs), covering the foundations of mathematical tools and techniques in modern data science. The first 5 days (Week 1) will consist of tutorial-style introductions to selected topics in this domain, and the final 3 days (Week 2) will consist of two-part talks covering introductory/tutorial content followed by recent research. This school is the third in the series following Darwin 2024 and Switzerland (Bernoulli Center) 2025.

Czech Summer School on Discrete Mathematics 2026

July 6-10, 2026
Pilsen, Czech Republic
https://www.mff.cuni.cz/en/iuuk/events/czech-summer-school-on-discrete-mathematics

Registration deadline: March 1, 2026

Czech (formerly Prague) Summer School on Discrete Mathematics is held every two years since 2016. Currently, it is jointly organized by the Computer Science Institute of Charles University and the Department of Mathematics of University of West Bohemia, and supported by the RSJ foundation. The School is primarily intended for PhD students and early career researchers, and we offer travel support for selected participants who lack funding.