Winter School on Cryptography and Machine Learning

January 25-28, 2027
Bocconi University, Milan, Italy
https://bidsa.unibocconi.eu/cryptography-and-machine-learning-2027-winter-school

AI systems are now deployed at scale, yet we have very few rigorous guarantees about their security, privacy and safety.
For decades, cryptography has developed the tools to reason formally about adversarial behaviour and to prove security against it. Many pressing questions about modern AI are, at heart, cryptographic: making AI-generated content traceable, defending models against adversarial attacks, planting and detecting backdoors, computing on private models and data, and making AI systems safe. This four-day school at Bocconi University, January 25-28, 2027, introduces researchers in cryptography, theoretical computer science, machine learning and AI safety to this fast-growing field, from foundational concepts to the state of the art. Lectures cover secure computation over models, privacy and unlearning, watermarking and steganography, adversarial machine learning, robustness and backdoors, and cryptography for AI safety and agentic systems, among others. The school is open to students and researchers at all career stages.

IHP school on AI for mathematicians and theoretical physicists

February 22-26, 2027
Institut Henri Poincare, Paris
https://indico.math.cnrs.fr/event/17079/

Registration deadline: November 30, 2026

Recent breakthroughs have shown that AI can now prove theorems.
At the same time, many of the deepest open questions in AI are, at heart, questions of mathematics and physics: high-dimensional geometry, non-convex optimisation, the statistical mechanics of learning. AI is becoming both a tool for and a subject of research in our fields, and a working knowledge of it is fast becoming essential for every young researcher. This one-week IHP school on AI, February 22-26, 2027, will introduce the fundamental concepts of modern AI to PhD students and early-career researchers in mathematics and theoretical physics who do not specialise in the field. The programme combines lectures with hands-on lab sessions.

13th DIMACS Implementation Challenge: Network Flows 2.0

January 28, 2027
Lehigh University, Bethlehem, PA
https://coral.ise.lehigh.edu/flow-challenge-2-0/

Registration deadline: December 17, 2026

13th DIMACS Implementation Challenge: Network Flows 2.0 will take place in Bethlehem, PA, on January 28, 2027 (right after SODA). The program has been published on the event’s website. Registration is now open. We the event site for more information.

Celebrating Ran Raz’s 60th Birthday

December 27-29, 2026
Steinhardt Museum of Natural History, next to Tel Aviv University, Tel Aviv, Israel https://www.ranraz60.org

Registration deadline: December 6, 2026

Please join us in Tel Aviv for a three-day conference celebrating Ran Raz’s 60th birthday. The scientific program will focus on lower bounds, randomness, space complexity, and quantum computation, four areas in which Ran’s work has shaped the questions we ask and the techniques we use to answer them. Participation is free. Please visit the conference website for the list of speakers and registration details.

Recent advances in Regularity Lemmas

November 17, 2026
Stanford University
https://regularitylemmas.github.io/

In recent years, a connection to algorithmic fairness, where this indistinguishability condition is known as multiaccuracy and its strengthening as multicalibration, has led to a surge of work on regularity lemmas. These results have clarified what can be achieved through multiaccuracy alone and what additional guarantees arise from different forms of calibration. They have also led to new connections and applications in complexity theory, cryptography, learning theory, information theory, and communication complexity, among other areas. This workshop brings together researchers working on these developments to discuss recent progress and open problems.

Bernoulli Center – Call for research programmes 2028

January 1 – December 31, 2028
Lausanne, Switzerland
https://bernoulli.epfl.ch/bernoulli-programs/

Submission deadline: March 31, 2027

The Bernoulli Center for fundamental studies calls for research programme proposals in the areas of mathematics, theoretical physics, and / or theoretical computer science. Programmes can range from two to nine weeks in duration. The period covered by the call is January to December 2028.

The deadline for proposal submissions is 31 March 2027.

More information is available on the website: https://bernoulli.epfl.ch/bernoulli-programs/

XVI Portuguese Category Seminar

November 12-14, 2026
Coimbra, Portugal
https://flnlucatelli.github.io/2026/pcs.html

Submission deadline: October 29, 2026
Registration deadline: November 5, 2026

The XVI Portuguese Category Seminar will take place at the University of Coimbra, Portugal, on 12–14 November 2026. The meeting brings together researchers and students working on category theory and its connections with computer science, logic, algebra and topology. Contributed talks are welcome. Registration is free, with an abstract submission deadline of 29 October and a registration deadline of 5 November.

9th Eastern Great Lakes (EaGL) Theory of Computation Workshop

October 17-18, 2026
Rochester, NY
https://www.cs.rochester.edu/u/shossei2/eagl2026website/index.html

Submission deadline: October 1, 2026
Registration deadline: October 1, 2026

The purpose of this annual workshop is to bring together researchers in theoretical computer science, who work in the vicinity of the eastern great lakes region. For 2026, this event is held at the University of Rochester.

Bridges between proofs, communication, and computation

November 30 – December 4, 2026
Isaac Newton Institute for Mathematical Sciences, University of Cambridge https://www.newton.ac.uk/event/lfcw03/

Registration deadline: September 20, 2026

This workshop will bring together researchers from several areas of complexity to discuss recent connections between proof complexity and computation. These connections often rely on ideas and techniques from communication complexity, algebraic complexity, circuit complexity, and the complexity of total search problems. They have led to new perspectives on the power and limitations of proof systems, and to new methods for establishing complexity lower bounds and unprovability results.

The talks will focus on developments in and around proof complexity, including communication-based lower-bound methods, lifting theorems, algebraic techniques, circuit lower bounds, and connections with search problems. The workshop will provide a forum for presenting current research with emphasis on lower bounds, barriers, and connections between different models of computation and proofs.