June 24-28, 2024
Vancouver, BC
http://acm-stoc.org/stoc2024/index.html

STOC/TheoryFest 2024 is in Vancouver, British Columbia this year, during the week of June 24-28. The registration website is now open at http://acm-stoc.org/stoc2024/registration.html

In addition to the STOC 2024 paper talks, the program features keynote talks by Michal Feldman, Jakub Pachocki, and Tim Roughgarden, and workshops on Algorithmic Problems in Modern LLMs, Extremal Combinatorics, Length-Constrained Expanders, Online Resource Allocation, and a special workshop on TCS Mentoring, Diversity, and Outreach.

July 8-12, 2024
Budapest, Hungary
https://conferences.renyi.hu/summit280/home

Submission deadline: March 31, 2024
Registration deadline: May 15, 2024

In 2024, Péter Frankl, Zoltán Füredi, Ervin Győri and János Pach will turn 70. On the occasion of this joyful event, we organize a conference Sum(m)it280. We would like to invite you to celebrate these four Hungarian combinatorialists with us. List of invited speakers: Noga Alon, Maria Axenovich, Jacob Fox, Balázs Keszegh, Younjin Kim, Alexandr Kostochka, Andrey Kupavskii, László Lovász, Abhishek Methuku, Géza Tóth, Jacques Verstraete, Jian Wang

January 20, 2024 – December 20, 2025
UCSD
https://encore.ucsd.edu/encore-visitors-program/

The Institute for Emerging CORE Methods in Data Science (EnCORE) welcomes proposals for extended research visits between 2024-2025. Each extended research visit proposal needs to identify 3-5 researchers who will be spending 2-4 weeks at the institute working on their proposed research theme.

Foundational questions in all areas of Computer Science, Data Science, and AI are within scope. A proposal may aim to solve long-standing open questions in an established area or identify new theoretical directions in an emerging application area, or enable bridging between theory and practice among others. Moreover, each team will be organizing a workshop (3 to 5 days) during their stay at UCSD related to the research theme, bringing in additional participants (up to 20 including the organizers) to facilitate further dialogues. Proposals from industry are welcome and encouraged.

Please submit your proposal in .pdf format. Include a title, and a brief description (maximum 2 pages) detailing the research topic and why a particular knowledge gap should be addressed. Each proposal should also include a 1-2 paragraph description of the proposed workshop and a tentative list of participants.

Each member of the organizing research team will be reimbursed their actual living expenses at San Diego up to $1000 per week, or they can receive a fixed stipend (subject to applicable taxes) in lieu of actual expenses. In addition, a fixed funding will be available for each workshop. The EnCORE institute will provide suitable collaboration space, offices for the team members, and open-style seminar room to host workshops with all necessary facilities free of charge.

The proposal will be evaluated based on its intellectual merit and broader impact with careful consideration given to the teams that uphold diversity and equity along with their potential to collaborate with existing UCSD faculty. Upon the end of each extended visit, the team will submit an intermediate report elaborating the outcome, and a one-year anniversary report delineating subsequent developments.

January 8-9, 2024
Alexandria, VA
https://www.siam.org/conferences/cm/conference/sosa24

Submission deadline: August 10, 2023

The 7th Symposium on Simplicity in Algorithms will be co-located with SODA 2024, in Alexandria, VA. Papers in all areas of algorithms research are sought. An ideal submission will advance our understanding of an algorithmic problem by, for example, introducing a simpler algorithm, presenting a simpler analysis of an existing algorithm, or offering insights that generally simplify our understanding of important algorithms or computational problems. Paper registration by August 10, submission by August 17, 2023.

October 17-21, 2022
Guanajuato, Mexico
https://delta.cs.cinvestav.mx/~francisco/Latin22/

Submission deadline: May 22, 2022

LATIN is devoted to different areas in theoretical computer science including, but not limited to: algorithms (approximation, online, randomized, algorithmic game
theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory,
computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, foundations of data science and theoretical machine learning, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, quantum computing, and random structures.

January 10-11, 2022
Alexandria, Virginia, U.S.
https://www.siam.org/conferences/cm/conference/sosa22

Submission deadline: August 9, 2021

Symposium on Simplicity in Algorithms is a conference in theoretical computer science dedicated to advancing algorithms research by promoting simplicity and elegance in the design and analysis of algorithms. The benefits of simplicity are manifold: simpler algorithms manifest a better understanding of the problem at hand; they are more likely to be implemented and trusted by practitioners; they can serve as benchmarks, as an initialization step, or as the basis for a “state of the art” algorithm; they are more easily taught and are more likely to be included in algorithms textbooks; and they attract a broader set of researchers to difficult algorithmic problems. Co-located with SODA 2022.

Paper registration: August 9; Submission deadline: August 16.

July 4, 2021 – July 7, 2021
Wrocław, Poland and online
https://cpm2021.ii.uni.wroc.pl/

The Annual Symposium on Combinatorial Pattern Matching (CPM) has by now over 30 years of tradition and is considered to be the leading conference for the community working on Stringology. The objective of the annual CPM meetings is to provide an international forum for research in combinatorial pattern matching and related applications such as computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition. The conference will be preceded by a student summer school on July 4, 2021. Registration is free but mandatory.

September 21 – December 12, 2020
Online (https://www.ideal.northwestern.edu/special-quarters/fall-2020/) https://www.ideal.northwestern.edu/special-quarters/fall-2020/registration

There will be a Special Quarter on Theory of Deep Learning this Fall as a part of IDEAL – The Institute for Data, Econometrics, Algorithms, and Learning, runs jointly with TTIC and the University of Chicago.

The Special Quarter will be entirely online, and take place inside a virtual space on the gather.town platform. All talks, discussions, meetings and other interactions will be inside this virtual space. To register for the special quarter, please complete the registration form below.

January 11-12, 2021
Westin Alexandria Old Town, Alexandria, Virginia, U.S.
https://www.siam.org/conferences/cm/conference/sosa21

Submission deadline: August 12, 2020
Registration deadline: December 7, 2020

Symposium on Simplicity in Algorithms is a conference in theoretical computer science dedicated to advancing algorithms research by promoting simplicity and elegance in the design and analysis of algorithms. The benefits of simplicity are manifold: simpler algorithms manifest a better understanding of the problem at hand; they are more likely to be implemented and trusted by practitioners; they can serve as benchmarks, as an initialization step, or as the basis for a “state of the art” algorithm; they are more easily taught and are more likely to be included in algorithms textbooks; and they attract a broader set of researchers to difficult algorithmic problems.

January 20, 2020
UC Riverside
https://www.cs.ucr.edu/~silas/

An all day event to celebrate the TCS research community in Southern California