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

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

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

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

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.

TTI-Chicago Summer Workshop Program

June 18 – September 14, 2018
TTI-Chicago, Chicago IL

Submission deadline: December 15, 2017

Would you like to get a group of 4-40 people together for a week to discuss a topic of common interest? Would you like to do it in an easy-to-reach vibrant city with a substantial local research community and with lodging, coffee breaks, and meeting room paid for by someone else? Is your topic of interest roughly within the areas of Theory, Machine Learning, Vision, NLP, Speech, Robotics, or Computational Biology? Then submit a proposal to the TTI-Chicago Summer Workshop Program! Workshops will run Monday-Friday (you can also propose a shorter workshop), and be held at TTI-Chicago. Dormitory-style lodging will be provided for free for up to 25 attendees. We will also supply continental breakfast and coffee breaks. Workshop structure is pretty much entirely up to you – talks, tutorials, brainstorming sessions, etc. – whatever works best for your topic. Workshop proposals (just 1-2 pages) are due December 15, 2017. More information at

Celebrating Don Knuth’s 80th Birthday

January 8-10, 2018
Piteå, Sweden

Donald Knuth’s 80th birthday on January 10, 2018 will be celebrated by two connected events, both in Piteå, Sweden.

January 8-10 (Monday-Wednesday morning): The scientific symposium ”Knuth80: Algorithms, Combinatorics, and Information” in honor of Don’s career-long efforts that have inspired us all. Don’s interests and accomplishments are very broad, and the symposium will therefore include contributions from distinguished scientists in several areas where Don’s influence has been important.

January 10, afternoon (Wednesday): The world premiere of Fantasia Apocalytica, a multimedia work for pipe organ and video that Don has written. It will be performed by the Canadian organist Jan Overduin on the magnificent new pipe organ in Studio Acusticum in Piteå.

Symposium on Simplicity in Algorithms 2018

January 7-10, 2018
New Orleans

Submission deadline: August 24, 2017

The Symposium on Simplicity in Algorithms is a new conference in theoretical computer science dedicated to advancing simplicity and elegance in the design and analysis of algorithms. The 1st SOSA will be co-located with SODA 2018 in New Orleans. Ideal submissions will present simpler algorithms for important algorithmic problems, or present simpler analyses of known algorithms, or offer insights that simplify our understanding of important computational problems.

Omni Buss Celebration

July 14, 2017
UC San Diego

In celebration of Samuel Buss’s 60th birthday, we are organizing an Omni Buss celebration. As Sam’s work has had major impact on many areas of mathematics and computer science, including logic, proof complexity computational complexity, algorithms and graphics, the celebration will feature an eclectic combination of speakers.

Discrete Geometry and Convexity BÁRÁNY 70

June 19-23, 2017
Budapest, Hungary

The aim of the conference is to celebrate the scientific achievements of professor Imre Bárány, a pioneering researcher of discrete and convex geometry, topological methods, and combinatorics. The conference will consist of invited 45 minute talks by prominent mathematicians whose work has special connections to that of Imre. The topics to be covered include: discrete and combinatorial geometry, convex geometry and general convexity, topological and combinatorial methods.