Theory and Practice of Differential Privacy (part of CCS 2019)

November 11, 2019
London, UK
https://tpdp.cse.buffalo.edu/2019/

Submission deadline: June 21, 2019

The fifth annual workshop on the Theory and Practice of Differential Privacy will be held as a part of CCS 2019 on November 11. We seek contributions from different research areas of computer science and statistics. Authors are invited to submit a short abstract (4 pages maximum) of their work. Submissions will undergo a lightweight review process and will be judged on originality, relevance, interest and clarity. Submission should describe novel work or work that has already appeared elsewhere but that can stimulate the discussion between different communities at the workshop. Accepted abstracts will be presented at the workshop either as a talk or a poster. The workshop will not have formal proceedings and is not intended to preclude later publication at another venue. Selected papers from the workshop will be invited to submit a full version of their work for publication in a special issue of the Journal of Privacy and Confidentiality.

Tensors: Algebra-Computation-Applications

June 3-14, 2019
U. Colorado Boulder and Colorado State U
https://thetensor.space/workshops/2019/02/13/TACA-2019.html

The Department of Mathematics at Colorado State University and the Department of Computer Science at the University of Colorado, Boulder invite interested participants to attend a workshop and conference on Tensors: Algebra, Computation, and Applications (TACA).

The central theme of tensors is meant to bring together several complementary research areas––pure and applied mathematics, quantum physics, big data, scientific computing, and theoretical computer science––whose interactions could lead to breakthroughs.

The workshop will consist of:
Mini-courses + group problem sessions (June 4—8, U. Colorado Boulder Campus)
Presentations of contemporary research and software demonstrations (June 9-14, Colorado State University “Pingree Park” Mountain Campus).

UK-Russia Workshop on AI for Software Engineering

September 9-12, 2019
York, UK
https://aise.research.jetbrains.org/

Registration deadline: May 26, 2019

This workshop will bring together AI and SE researchers from the UK and Russia (and potentially other countries) to discuss applications of AI to SE, specifically ML and NLP, and develop future directions of research in this emerging area. Application examples include program analysis (e.g. extracting knowledge from documentation, code reuse), prediction (e.g. finding defects, predicting development time and cost), synthesis and generation (e.g. smart code completion), and transformation (e.g. software remodularization, automated bug fixes).

To date, there are first successes in AI for SE, but much more can be achieved. Progress is slowed by the lack of researchers with expertise in both areas. Bringing together AI and SE researchers will be instrumental in moving this research forward. The four-day workshop will feature tutorials and keynote lectures, but most of the time will be dedicated to networking and creation of new collaborative projects.

Workshop on Algebraic Complexity Theory

March 25-29, 2019
The International Centre for Theoretical Sciences (ICTS), Bengaluru (India) https://www.icts.res.in/discussion-meeting/wact2019

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.

Parameterized Approximation Algorithms Workshop (PAAW) 2019

July 8, 2019
Patras, Greece
https://sites.google.com/site/aefeldmann/parameterized-approximation-algorithms-workshop-paaw-2019

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

PCP-fest 2018

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.