Summer School on Randomness and Learning in Non-Linear Algebra

July 1-4, 2019
Leipzig, Germany

This summer school aims at bringing together researchers working on probabilistic and statistical methods and questions in nonlinear algebra. Keynote speakers will be:

Peter Bürgisser (Technische Universität Berlin)
Daniel Erman (University of Wisconsin-Madison)
Antonio Lerario (Scuola Internazionale Superiore di Studi Avanzati)

Workshop on Algebraic Complexity Theory

March 25-29, 2019
The International Centre for Theoretical Sciences (ICTS), Bengaluru (India)

The primary objective of this workshop is to bring together experts in the field of algebraic complexity and related areas to present their research, initiate collaborations etc. The idea is to continue the tradition of having a Workshop on Algebraic Complexity Theory every year.

Summer School on Artificial Intelligence

July 4-7, 2019
Moscow, Russia

RAAI Summer School is a 4-day school with tutorials and practical workshops on:

Machine Learning and Data Analysis
Simulation of Human Cognitive Functions
Natural Language Processing
Multi-Agent Systems and Coalitions

Together with the school, there will be a hackathon in reinforcement learning using computer vision tasks.

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.

Caleidoscope : Complexity as a Kaleidoscope

June 17-21, 2019
Paris, France

Research school in computational complexity. 17-21 June 2019, Institut Henri Poincaré, Paris.


The Caleidoscope school will be comprise of four main lecture courses, based on some of the most developed approaches to computational complexity today.

1. Boolean circuits and lower bounds. (Rahul Santhanam, University of Oxford).
2. Algebraic circuits and geometric complexity. (Peter Bürgisser, Technical University Berlin).
3. Proof complexity and bounded arithmetic; (Samuel Buss, University of California San Diego).
4. Machine-free complexity (descriptive and implicit complexity). (Anuj Dawar, University of Cambridge and Ugo Dal Lago, University of Bologna)

In addition to these broad-ranging themes, there will also be three more focussed topics, providing examples of (already established or potential) interactions between logic, algebra and complexity:

5. Constraint satisfaction problems. (Libor Barto, Charles University in Prague). 6. Communication complexity. (Sophie Laplante, Paris 7 University).
7. Duality in formal languages and logic. (Daniela Petrisan, Paris 7 University).

Parameterized Approximation Algorithms Workshop (PAAW) 2019

July 8, 2019
Patras, Greece

Submission deadline: April 26, 2019
Registration deadline: April 30, 2019

The 2019 edition of the Parameterized Approximation Algorithms Workshop (PAAW) will take place as a satellite workshop of ICALP 2019 in Patras, Greece, on Monday July 8th 2019.

— Topics of interest —
– Parameterized approximation algorithms
– Lossy kernelization
– Parameterized inapproximability
– Fine-grained complexity of approximation
– Subexponential time approximation
– Efficient polynomial-time approximation schemes