October 10-12, 2025
Pittsburgh, PA
https://sites.google.com/andrew.cmu.edu/acorn-2025/home

Carnegie Mellon University will be hosting the 2025 ACORN (Algorithms, Combinatorics, and Optimization Research Network) Workshop, October 10-12, 2025. Registration is now open at the website here: https://sites.google.com/andrew.cmu.edu/acorn-2025/home

ACORN (Algorithms, Combinatorics, and Optimization Research Network) is a group of institutions, departments, and researchers committed to the principle that the fields of combinatorics, optimization, and algorithms share core ideas and methods and that their different perspectives bring new ideas, questions, and techniques to the other fields. Following in the footsteps of previous “Watermellon” workshops organized by CMU and Waterloo, the first ACORN meeting was jointly organized by the three schools with joint ACO PhD programs (Georgia Tech, CMU, and Waterloo) and was held at Georgia Tech in March 2023. See https://sites.gatech.edu/acorn/

October 11-12, 2025
Rochester, NY
https://www.cs.rochester.edu/u/shossei2/eagl2025website/index.html

Registration deadline: September 20, 2025

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 2025, this event is held at the University of Rochester, NY, USA.

December 11-13, 2025
University of Sydney, Australia
https://sites.google.com/view/celebration-tcs-2025/

Registration deadline: December 1, 2025

This (free) mentoring and research event will take place at the University of Sydney, just before FOCS 2025, to celebrate the richness and collegiality of the Theoretical Computer Science community. This event, co-organized with TCS For All, will feature a mix of inspirational and rising star talks, a poster session, and plenty of time for discussions and socializing with other members of the TCS community.

Students, faculty, and researchers of all seniority levels are welcome. Applications for travel support (accommodation) are due by September 19.

October 25-26, 2025
UT Austin
https://www.cs.utexas.edu/~davidfest/

This October, we are holding a pseudorandomness workshop in celebration of David Zuckerman’s 60th birthday.
We will gather at UT Austin on October 25-26 (Saturday-Sunday), and we’re happy to invite everyone who’s interested to join us!
The plan is to have an exciting time celebrating David, his influential work, and the many beautiful developments in pseudorandomness.

September 22-23, 2025
University of Warwick, UK
https://sites.google.com/view/algorithmscomplexitywarwick2/home

Registration deadline: September 10, 2025

The Workshop Algorithms & Complexity @ Warwick will be held on 22-23 September at the University of Warwick. 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 in the UK. Everyone is welcome to attend, but to help us plan the event, please register by 10/September.

December 14-17, 2025
Sydney, Australia
https://focs.computer.org/2025/call-for-workshops/

Submission deadline: September 5, 2025

The FOCS 2025 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.

We invite groups of interested researchers to submit workshop proposals by September 5.

August 13-15, 2025
Toyota Technological Institute at Chicago
https://sites.google.com/ttic.edu/incentivesdatasharing/home

Submission deadline: July 31, 2025
Registration deadline: July 31, 2025

Machine Learning (ML) has achieved remarkable milestones in recent years, but its future hinges on a robust, ethically grounded, and well-incentivized data infrastructure. The next era of AI innovation requires specialized data that is scarce, proprietary, or sensitive (e.g., medical records, autonomous vehicle data, pharmaceutical test results). Collecting such data is cost and labor-intensive and subject to strict privacy and legal constraints. Simultaneously, the era of “free” or lightly regulated data (e.g., scraped from the public internet) is drawing to a close as copyright and user consent concerns rise — evidenced by legal challenges to large generative models and platform restrictions on web scraping. Taken together, these developments underscore the need for a new AI paradigm — one in which data rights are respected, data owners receive fair compensation, and valuable datasets are shared and reused to unlock novel applications. This raises the central question we want to address in our workshop: “How can we design incentive mechanisms to promote data sharing while safeguarding privacy, fairness, and intellectual property?”

August 11-13, 2025
Oxford, UK
https://feasible-math.org/events/PC25/

Proof complexity is a vibrant area in the intersection of computational complexity, algorithms and mathematical logic exploring the inherent difficulty of proving statements in different formal proof systems. This workshop aims to cover both traditional topics and emerging trends in the field, including lower bounds on lengths of proofs, bounded arithmetic, model theory, SAT-solving, connections to algebraic complexity and TFNP, lifting theorems and meta-mathematics of complexity theory. To register for the workshop, please use the following Registration Form: https://form.jotform.com/251323981206352