Aggregator for CS theory workshops, schools, and so on
August 13-17, 2018
Saarbrücken, Germany
http://resources.mpi-inf.mpg.de/conferences/adfocs/
ADFOCS is an international summer school with the purpose of introducing young researchers to topics which are the focus of current research in theoretical computer science. This year’s topic is *Fine-Grained Complexity and Algorithms*. The lecturers are Amir Abboud (IBM Almaden), Danupon Nanongkai (KTH), and Ramamohan Paturi (UC San Diego).
October 1-6, 2018
Hong Kong
http://seta2018.ust.hk/
Submission deadline: May 8, 2018
Registration deadline: July 17, 2018
The focus of the conference is on sequences and their applications in communications, cryptography, coding, and combinatorics, as well as on related topics in discrete mathematics.
July 9, 2018
Prague, Czechia
https://sites.google.com/site/aefeldmann/workshop
Submission deadline: April 20, 2018
Registration deadline: May 31, 2018
Two standard approaches to handle hard (typically NP-hard) optimization problems are to develop approximation and parameterized algorithms. For the former, the runtime should be polynomial in the input size, but the computed solution may deviate from the optimum. For the latter, the optimum solution should be computed, but any super-polynomial runtime should be isolated to some parameter of the input. Some problems however are hard to approximate on one hand, and on the other it is also hard to obtain parameterized algorithms for some given parameter. In this case one may still hope to obtain parameterized approximation algorithms, which combine the two paradigms, i.e. the computed solution may deviate from the optimum and the runtime should have super-polynomial dependence only in some given parameter. Recently there has been a great deal of development in proving the existence or non-existence of parameterized approximation algorithms, and the aim of this workshop is to bring together active researchers of this emerging field, so that they may share their results and insights.
April 22-26, 2018
Jerusalem
https://iiashdc.wordpress.com/april-conference-iias-huji/
Registration deadline: April 13, 2018
Combinatorics in general, and the theory of expander graphs in particular, have been fruitful areas of interaction between pure and applied mathematics. In recent years, a “high dimensional” combinatorial theory has emerged. Aside from its intellectual appeal, this theory has a great potential for various applications in mathematics and computer science. This theory calls for a cooperation of experts in these different fields. The conference will bring leading experts in these topics.
May 14-17, 2018
Athens, GA, USA
http://research.franklin.uga.edu/additive-combinatorics/georgia-discrete-analysis
The purpose of the conference is to exchange ideas related to the latest developments in discrete analysis with a focus on those in arithmetic combinatorics.
June 18-22, 2018
Paris
http://geomschool2018.univ-mlv.fr/
Registration deadline: April 15, 2018
This is a one-week school devoted to low-dimensional geometry and topology, from both the viewpoints of mathematicians and computer scientists. It is aimed at graduate students and researchers in mathematics and computer science interested in geometric or topological aspects. This includes, not exhaustively, mathematicians working in differential, Riemannian, or topological geometry; and computer scientists working in computational geometry or topology. The goal is to foster interactions between these communities.
June 4-8, 2018
Institute for Advanced Study, Princeton
https://www.math.ias.edu/ocit2018
Registration deadline: April 15, 2018
This workshop aims to explore connections between complexity and optimization with algebra and analysis, which have emerged from the works on operator scaling. The hope is to inform participants from different communities of both basic tools and new developments, and set out new challenges and directions for this exciting interdisciplinary research.
