ICALP (and LICS) 2020 – Relocation and Extended Deadline

Due to the Wuhan coronavirus outbreak, the organizers of ICALP and LICS have made the difficult decision to relocate both (co-located) conferences from Beijing, China, to Saarbrücken, Germany. Speaking specifically about ICALP now (I do not have further information about LICS): As a result of previous uncertainty regarding the situation, the deadline has been extended by about six days, until Tuesday February 18, 2020, at 6 AM GMT. The dates of the conference remain (roughly) the same, July 8 – 11, 2020.
The following is a more official message from ICALP Track A Chair, Artur Czumaj.


The ICALP and the LICS steering committee have agreed together with the conference chairs in Beijing to relocate the two conferences.
ICALP and LICS 2020 will take place in Saarbrücken, Germany, July 8 – 11 2020 (with satellite workshops on July 6 – 7 2020).
The deadline is extended, see below.

Call for Papers – ICALP 2020
July 8 – 11 2020, Saarbrücken, Germany

NEW Paper submission deadline: Tuesday February 18, 2020, 6am GMT
https://easychair.org/conferences/?conf=icalp2020

ICALP (International Colloquium on Automata, Languages and Programming) is the main European conference in Theoretical Computer Science and annual meeting of the European Association for Theoretical Computer Science (EATCS). ICALP 2020 will be hosted on the Saarland Informatics Campus in Saarbrücken, in co-location with LICS 2020 (ACM/IEEE Symposium on Logic in Computer Science).

Invited speakers:
Track A: Virginia Vassilevska (MIT), Robert Krauthgamer (Weizmann)
Track B: Stefan Kiefer (Oxford)
Joint ICALP-LICS: Andrew Yao (Tsinghua), Jérôme Leroux (Bordeaux)

Submission Guidelines: see https://easychair.org/conferences/?conf=icalp2020

NEW Paper submission deadline: February 18, 2020, 6am GMT
notifications: April 15, 2020
camera ready: April 28, 2020

Topics: ICALP 2020 will have the two traditional tracks
A (Algorithms, Complexity and Games – including Algorithmic Game Theory, Distributed Algorithms and Parallel, Distributed and External Memory Computing) and
B (Automata, Logic, Semantics and Theory of Programming).
    (Notice that the old tracks A and C have been merged into a single track A.)
Papers presenting original, unpublished research on all aspects of theoretical computer science are sought.

Typical, but not exclusive topics are:

Track A — Algorithmic Aspects of Networks and Networking, Algorithms for Computational Biology, Algorithmic Game Theory, Combinatorial Optimization, Combinatorics in Computer Science, Computational Complexity, Computational Geometry, Computational Learning Theory, Cryptography, Data Structures, Design and Analysis of Algorithms, Foundations of Machine Learning, Foundations of Privacy, Trust and Reputation in Network, Network Models for Distributed Computing, Network Economics and Incentive-Based Computing Related to Networks, Network Mining and Analysis, Parallel, Distributed and External Memory Computing, Quantum Computing, Randomness in Computation, Theory of Security in Networks

Track B — Algebraic and Categorical Models, Automata, Games, and Formal Languages, Emerging and Non-standard Models of Computation, Databases, Semi-Structured Data and Finite Model Theory, Formal and Logical Aspects of Learning, Logic in Computer Science, Theorem Proving and Model Checking, Models of Concurrent, Distributed, and Mobile Systems, Models of Reactive, Hybrid and Stochastic Systems, Principles and Semantics of Programming Languages, Program Analysis and Transformation, Specification, Verification and Synthesis, Type Systems and Theory, Typed Calculi

PC Track A chair: Artur Czumaj (University  of Warwick)
PC Track B chair: Anuj Dawar (University of Cambridge)

Contact
All questions about submissions should be emailed to the PC Track chairs:
Artur Czumaj A.Czumaj@warwick.ac.uk<mailto:A.Czumaj@warwick.ac.uk>
Anuj Dawar Anuj.Dawar@cl.cam.ac.uk<mailto:Anuj.Dawar@cl.cam.ac.uk>

Theory and Practice of Differential Privacy 2019

While I’m a relative newcomer to differential privacy (my first paper on it was only in 2017), I’ve found the community to be a pleasure to interact with: paradoxically, simultaneously tight-knit yet highly welcoming to newcomers. I partially credit this culture to the number of workshops and programs which bring people together, including, but not limited to, a BIRS workshop, the Privacy Tools project at Harvard, a semester at the Simons Institute, the forthcoming Shonan workshop, and the Theory and Practice of Differential Privacy (TPDP) Workshop.

I’m writing this post to draw attention to the imminent deadline of TPDP 2019, co-located with CCS 2019 in London. I’ll spare you the full details (click the link for more information), but most pressing is the deadline tomorrow, June 21, 2019, anywhere on Earth (let me know if this presents hardship for you, and I can pass concerns on to the chair). Essentially anything related to the theory or practice of differential privacy is welcome. Submissions are limited to four pages in length and are lightly refereed, based on originality, relevance, interest, and clarity. There are no published proceedings, and previously published results are welcome. If you’ve been looking to get to know the community, consider either submitting or attending the workshop!

Hello World!

Welcome to my blog! My name is Gautam Kamath, and I just started as an assistant professor in computer science at the University of Waterloo (for more info, see About).

This blog will, broadly speaking, be about topics relevant to those interested in the the theory of computer science, statistics, and machine learning. Posts will range from technical, to informational, to meta (read: basically whatever I want to write about, but I’ll do my best to keep it topical). Stay tuned!

The unofficial theme song of this blog is “Mathematics” by Mos Def.