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 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.

The workshop will be streamed live at
http://www.math.ias.edu/ocit2018_live-feed

June 19-22, 2018
Harvard University, Cambridge, MA
https://womenintheory.wordpress.com/

Registration deadline: January 16, 2018

This is a workshop for female graduate students and exceptional undergraduates (fourth year) in theoretical computer science. The workshop will have first-rate technical content and will be a great opportunity for students to meet their peers from around the world.
We will supply dorm rooms, breakfast and lunch, and will probably also be able to cover at least part if not all of the travel expenses.
More detailed information including how to apply can be found on the workshop website.

June 18-20, 2018
Paris, France
http://ctw18.lipn.univ-paris13.fr/

Submission deadline: February 2, 2018
Registration deadline: May 2, 2018

The Cologne-Twente Workshop on Graphs and Combinatorial Optimization 2018 welcomes contributions on theory and applications of discrete algorithms, graphs and combinatorial optimization in the wide sense (4-page “long abstract” submissions invited).

October 14, 2017
FOCS 2017, Berkeley
https://raghumeka.github.io/workshop.html

The topic of this workshop is ‘hardness escalation’, a growing research area whereby lower bounds and separations in communication complexity are obtained by developing “simulation theorems”. The basic idea of a simulation theorem is to start with a simple ‘one-party’ function and “lift it” to a multi-party setting via function composition. These simulation theorems have introduced new tools into complexity theory, and have led to the resolution of many longstanding open problems including in graph theory, combinatorial optimization, circuit complexity and cryptography, proof complexity, game theory, and communication complexity. Moreover the field has led to a revival of query complexity, with new techniques leading to the resolution of some longstanding open problems. The goal of the workshop is to present a broad introduction to the area as well as highlight the recent developments.

October 20, 2017
Northwestern University, Evanston, IL, USA
https://theory.eecs.northwestern.edu/qtw-analytic/

November 22-23, 2017
Tel-Aviv University, Israel
https://www.irif.fr/~filofocs/FILOFOCS2017/

This is the 6th edition of this series of workshops
and is part of the activities of FILOFOCS (French-Israeli Laboratory on Foundations of Computer Science), a LEA (Laboratoire Européen Associé) of the CNRS and Tel-Aviv University. See
http://www.liafa.univ-paris-diderot.fr/~adiro/filofocs//filofocs_lab/filofocs_lab.html for more details on the previous workshops and other activities of FILOFOCS.

June 23, 2017
STOC 2017, Montreal, Canada
https://users.cs.duke.edu/~rongge/stoc2017ml/stoc2017ml.html

Submission deadline: May 27, 2017

Machine learning has gone through a major transformation in the last decade. Traditional methods based on convex optimization have been replaced by highly non-convex approaches including deep learning. In the worst-case, the underlying optimization problems are NP-hard. Therefore to understand their success, we need new tools to characterize properties of natural inputs, and design algorithms that work provably in beyond-worst-case settings. In particular, robustness and nonconvexity are two of the major challenges.

June 23, 2017
Montreal
https://www.cs.princeton.edu/~smattw/STOC17BMD/

Submission deadline: May 12, 2017
Registration deadline: May 21, 2017

Mechanism Design is a subarea at the intersection of economics and algorithms that has in recent years benefited tremendously from TCS-centric approaches and the TCS toolkit. The goals of this workshop are to highlight recent theoretical advances in mechanism design, and to provide an overview of current/future research directions that are accessible to TCS researchers. The workshop will focus on the following three themes: Learning and Mechanism Design; Duality in Mechanism Design; Simple versus Optimal Mechanisms.

We are soliciting posters on any topic related to mechanism design.

August 30, 2017
Melbourne, Australia
http://agt2017.net.technion.ac.il

Submission deadline: May 14, 2017