Theory and Practice of Differential Privacy Workshop

October 15, 2018
Toronto, Canad
https://tpdp.cse.buffalo.edu/2018/

Submission deadline: July 20, 2018

TPDP is a workshop on differential privacy which will be collocated with CCS 18 in Toronto. Differential privacy is a promising approach to privacy-preserving data analysis providing strong worst-case guarantees about the harm that a user could suffer from participating in a the data analysis. Researchers in differential privacy span many distinct research communities, and this workshop will bring researchers from these communities together to discuss recent developments in both the theory and practice of differential privacy. Authors are invited to submit a short abstract (2-4 pages maximum) of their work. Submission should describe novel works or works that have already appeared elsewhere but that can stimulate discussions. Accepted abstracts will be presented at the workshop either in technical sessions or as posters. The workshop will not have formal proceedings and is not intended to preclude later publication at another venue.

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.

Quarterly Theory Workshop: Algorithmic Fairness

June 8, 2018
Northwestern University
https://theory.eecs.northwestern.edu/events/algorithmic-fairness/

Registration deadline: June 8, 2018

As algorithmic systems have increasingly been deployed to make consequential decisions, it is becoming urgent that we grapple with the problem of (un)fairness and discrimination. These are delicate issues — to think rigorously about them, we first need to figure out how to formally define what we want, and then reason about how we might go about achieving our goals algorithmically — and what tradeoffs we will have to manage. This workshop focuses on recent advances in the theory of algorithmic fairness: both on foundational definitional questions, and on algorithmic techniques. The speakers are Nicole Immorlica (MSR), Jon Kleinberg (Cornell), Omer Reingold (Stanford), and Aaron Roth (U. of Pennsylvania).
The technical program of this workshop is organized by Aaron Roth and Jason Hartline.

19th Max-Planck Advanced Course on the Foundations of Computer Science

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

The 10th conference on sequences and their applications

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.

Parameterized Approximation Algorithms Workshop

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.

Conference on High Dimensional Combinatorics

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.