Celebrating Ran Raz’s 60th Birthday

~ shacharlovett

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

~ shacharlovett

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

~ shacharlovett

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

~ shacharlovett

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

~ shacharlovett

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

~ shacharlovett

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.

FOCS 2026 Workshop Day — Call for Proposals

~ shacharlovett

November 8, 2026
New York City, USA
https://focs.computer.org/2026/call-for-workshops/

Submission deadline: July 31, 2026

FOCS 2026 will hold workshops on Sunday, November 8. We invite groups of interested researchers to submit workshop proposals.

The FOCS 2026 workshops provide an informal forum for researchers to discuss important research questions, directions, and challenges in the field. Workshops often serve the vital purpose of introducing researchers to new areas and agendas. We also encourage workshops focusing on connections between theoretical computer science and other areas.

Celebrating 100 Years: Avi 70 + CSDM 30

~ shacharlovett

June 14-18, 2027
Institute for Advanced Study, Princeton, NJ, USA
https://www.ias.edu/math/events/celebrating-100-years-avi-70-csdm-30

The Institute for Advanced Study’s School of Mathematics is pleased to announce a conference celebrating Avi Wigderson’s 70th birthday and retirement, together with 30 years of the Computer Science and Discrete Mathematics program (CSDM) at IAS. The conference will honor both Avi’s extraordinary scientific legacy and his transformative role in shaping the intellectual community around theoretical computer science and discrete mathematics at IAS.

Avi Wigderson has made foundational contributions across an exceptional range of areas in theoretical computer science and mathematics. His work has had a profound impact on complexity theory broadly, and especially on cryptography, circuit and proof complexity, communication complexity, pseudorandomness, and expander graphs; in recent years, he has also opened deep and unexpected connections to invariant theory. These contributions have shaped major research directions and influenced generations of mathematicians and theoretical computer scientists.

Workshop on Local Algorithms

~ shacharlovett

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.