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.

Symposium on 50 Years of Complexity Theory: A Celebration of the Work of Stephen Cook

May 6-9, 2019
The Fields Institute, Toronto, Ontario, Canada
http://www.fields.utoronto.ca/activities/18-19/NP50

This symposium celebrates 50 years of NP-Completeness and the outstanding achievements of Stephen Cook and his remarkable influence on the field of computing.

The symposium begins Monday evening May 6, with a reception and a public lecture by Christos Papadimitriou. The scientific program continues Tuesday May 7 to Thursday May 9 and features an outstanding set of speakers, including a number of Turing Award and other award winners. On Thursday there will be a student round table lunch with Stephen Cook.

Registration is less than $150 USD (less than $75 USD for students and postdocs) and is highly subsidized (thanks to our sponsors!). It includes coffee breaks and lunch (May 7-8) as well as a special banquet on Wednesday evening. The Monday public event is free, and has a separate registration.

Thanks to several grants from our sponsors, there is funding to help with travel support for students and postdocs. Please visit the “Apply for Funding” link on the webpage to apply.

The 14th International Computer Science Symposium in Russia

July 1-5, 2019
Novosibirsk, Russia
https://logic.pdmi.ras.ru/csr2019/

Submission deadline: December 23, 2018

CSR is an annual international conference held in Russia that is designed to cover a broad range of topics in Theoretical Computer Science. Along with contributed talks, the program will include a keynote lecture by Andrew Yao and several invited talks.

Symposium on Simplicity in Algorithms

January 6-9, 2019
San Diego, CA
https://simplicityinalgorithms.com/

Submission deadline: August 16, 2018

The Symposium on Simplicity in Algorithms (SOSA) welcomes papers that advance simplicity and elegance in both the design and analysis of algorithms.

The 2nd Symposium on Simplicity in Algorithms (SOSA 2019) will be co-located with SODA 2019, January 6–9, 2019, in San Diego California.

New York Area Theory Day (Fall 2017)

December 1, 2017
New York University
http://www.cs.columbia.edu/theory/f17-tday.html

The New York Area Theory Day is a semiannual event, aimed to bring together people in the New York Metropolitan area who are interested in theoretical computer science. This time it will take place at New York University and feature three long and five short talks on a broad variety of topics.