The 15th Latin American Theoretical Informatics Symposium

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.

5th SIAM Symposium on Simplicity in Algorithms

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.

Annual Symposium on Combinatorial Pattern Matching (summer school + conference))

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.

IDEAL Special Quarter (Theory of Deep Learning)

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.

SIAM Symposium on Simplicity in Algorithms

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.

15th International Computer Science Sysmposium in Russia

June 29 – July 3, 2020
Yekaterinburg, Russia
https://csr2020.sciencesconf.org/

Submission deadline: January 10, 2020

CSR is an annual international conference held in Russia that is designed to cover a broad range of topics in Theoretical Computer Science. The list of previous CSR conferences can be found at https://logic.pdmi.ras.ru/~csr/ .

PapaFest for Christos’ 70th birthday

September 6-8, 2019
Columbia University
http://papafest.cs.columbia.edu/

We are happy to invite you to Columbia University to celebrate Christos Papadimitriou’s contributions to science on the occasion of his 70th birthday, through a mix of talks, panels, and fun activities. One of world’s leading computer scientists, Christos is best known for his work in computational complexity, helping to expand its foundations, methodology and reach. Using computation as a scientific lens, he has also made seminal contributions to biology and the theory of evolution, economics and game theory—where he helped found the field of algorithmic game theory, artificial intelligence, robotics, databases, networks and the Internet, and more recently the study of the brain. In this 3 day celebration, we will celebrate the wealth of areas that Christos’s work has influenced directly, as well as areas that have been influenced, are being influenced, or might be influenced by the “algorithmic lens.”

3rd Symposium on Simplicity in Algorithms

January 6-7, 2020
Salt Lake City, UT
https://www.siam.org/Conferences/CM/Conference/sosa20

Submission deadline: August 9, 2019

Symposium on Simplicity in Algorithms is a new 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 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 2020.

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

New York Area Theory Day (Spring 2019)

May 10, 2019
Columbia University
http://www.cs.columbia.edu/theory/s19-tday.html

The New York Area Theory Day, co-organized by Columbia, IBM, and NYU, is a semi-annual conference aiming to bring together researchers in the New York Metropolitan area. It usually features a few hour long talks on recent advances in theoretical computer science. The speakers this time are Sepehr Assadi, Tal Rabin, Omri Weinstein, and Mark Zhandry.