December 18-20, 2018
Tel Aviv, Israel
https://sites.google.com/view/pcpfest

The PCP-fest is a PCP centered workshop, aiming to bring together researchers from around the world. The workshop will focus on the state of the art theoretical results on PCPs and future directions, as well as recent applications with regards to Blockchain technology.

December 7, 2018
Courant Institute at New York University
https://cs.nyu.edu/dynamic/news/colloquium/1100/

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 four talks on a broad variety of topics.

November 3, 2018
UC Irvine
https://www.ics.uci.edu/~irani/SouthernCaliforniaTheoryDay2018.html

Registration deadline: October 19, 2018

The purpose of the SoCal Theory Day is to bring together members of the SoCal TCS community for a day of talks and conversation. We have a great line up of speakers this year from SoCal institutions, in addition to guest speaker Umesh Vazirani from UC Berkeley. Breakfast, coffee breaks, and lunch will be provided. Attendance is free but registration is required.

November 16, 2018
Healey Family Student Center, Georgetown University, Washington, DC http://people.cs.georgetown.edu/jthaler/CATD.html

The Computer Science Department at Georgetown University is organizing the 2018 iteration of Capital Area Theory Day on November 16, 2018. We anticipate a lively day of talks and discussions on a range of topics in theoretical computer science. The event will be free to attend, but registration is requested. The technical program of this workshop is organized by Calvin Newport and Justin Thaler.

October 19, 2018
SDSC Auditorium, UC San Diego, La Jolla, CA
https://sites.google.com/eng.ucsd.edu/socaldb18/home?authuser=1

Registration deadline: September 12, 2018

This is a one-day workshop-style event to bring together academic DB/data management researchers in SoCal and DB-related companies in CA. The goal is to connect students with relevant technical folks in industry and to foster a closer community of SoCal DB researchers and aficionados. The topics of interest include all aspects of databases and data management–theory, algorithms, systems, hardware, HCI aspects, and DB-backed applications–as well as intersections with other fields. The program will include a few invited talks from academia and industry, lightning talks from industry, research updates from academic DB groups, and poster presentations by students. Attendance is free for all academics (faculty, students, and staff). We already have confirmations of participation from the academic DB groups of UCI, UCLA, UCR, UCSB, and USC, as well as from many companies.

January 14-18, 2019
Saarbrücken, Germany
http://people.mpi-inf.mpg.de/~cikenmey/tcsag/

Registration deadline: December 14, 2018

This workshop brings together experts from theoretical computer science and algebraic geometry to discuss the relations between the fields from different perspectives. The goal is to lay the foundations for new interdisciplinary collaborations.

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.

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.

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.