International Colloquium
on Automata, Languages
and Programming

University of Warsaw, July 10–14 2017

Call for papers

The 44th International Colloquium on Automata, Languages, and Programming (ICALP) will take place in Warsaw (Poland) on 10-14 July 2017.

ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS).


Important dates

Submission deadline: Friday, February 17, 2017, 23:59 PST
Author notification: April 14, 2017
Final manuscript due: April 30, 2017

Deadlines are firm; late submissions will not be considered.


Proceedings

ICALP proceedings are published in the Leibniz International Proceedings in Informatics (LIPIcs) series. This is a series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl - Leibniz Center for Informatics. LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge.


Invited speakers

Mikołaj Bojańczyk (University of Warsaw, Poland)
Monika Henzinger (University of Vienna, Austria)
Mikkel Thorup (University of Copenhagen, Denmark)


Topics

Papers presenting original research on all aspects of theoretical computer science are sought.

Track A: Algorithms, Complexity and Games
Track B: Logic, Semantics, Automata and Theory of Programming
Track C: Foundations of Networked Computation: Models, Algorithms and Information Management


Submission guidelines

Authors are invited to submit an extended abstract of no more than 12 pages, excluding references, in the LIPIcs style, presenting original research on the theory of Computer Science. The usage of pdflatex and the LIPIcs style file (see a sample article and the gzipped archive) are mandatory: papers that deviate significantly from the required format may be rejected without consideration of merit. All submissions are electronic via EasyChair.

All technical details necessary for a proper evaluation of a submission must be included in the 12-page submission or in a clearly-labelled appendix, to be consulted at the discretion of program committee members.

Authors are encouraged to also make full versions of their submissions freely accessible in an on-line repository such as ArXiv, HAL, ECCC.

Submissions should be made to the appropriate track of the conference. No prior publication or simultaneous submission to other publication outlets (either a conference or a journal) is allowed.


Should I submit my paper to Track A or Track C?

While the scope of Tracks A and B are generally well understood given their long history, the situation for Track C may be less obvious. In particular, some clarifications may be helpful regarding areas of potential overlap, especially between Tracks A and C.

The aim for Track C is to be the leading venue for theory papers truly motivated by networking applications, and/or proposing theoretical results relevant to real networking, certified analytically, but not necessarily tested practically. The motivation for the track was the lack of good venues for theory papers motivated by applications in networking. On the one hand, the good networking conferences typically ask for extended experiments and/or simulations, while the TCS community is hardly able to do such experiments or simulations. On the other hand, the good conferences on algorithms tend to judge a paper based only on its technical difficulty and on its significance from an algorithmic perspective, which may not be the same as when judging the paper from the perspective of impact on networks.

Several areas of algorithmic study of interest to track C have a broad overlap with track A. Graph algorithmics can belong in either, though if the work is not linked to networking, it is more appropriate in track A. Algorithmic game theory is another area of major overlap. Aspects involving complexity, the computation of equilibria and approximations, belong more in Track A, while results with applications in auctions, networks and some aspects of mechanism design belong in Track C.

Finally, it should be noted that algorithms and complexity of message-passing based distributed computing belong squarely in track C, while certain other aspects of distributed computing do not fall under its scope.


Best paper awards

As in previous editions of ICALP, there will be best paper and best student paper awards for each track of the conference. In order to be eligible for a best student paper award, a paper should be authored only by students and should be marked as such upon submission.


Call for workshops

Workshops affiliated with ICALP 2017 will be held on July 14-16 (after the main conference).

We invite proposals of workshops related to any of the three tracks of ICALP, as well as other areas of theoretical computer science.

In order to submit a proposal, get in touch with us by sending an e-mail to Filip Murlak. We will close submissions on November 30.

Before contacting us, think about the format of the workshop and your expectations. A rough estimate of the cost for a single participant is 50 EUR per day, including lunch and two coffee breaks.

Because of the limited capacity of the conference venue, we might not be able to accept all proposals.


PC for track A

Piotr Indyk (MIT, chair)

Peyman Afshani (Aarhus University)
Pankaj Agarwal (Duke)
Karl Bringmann (Max-Planck-Institute)
Arkadev Chattopadhyay (Tata Institute of Fundamental Research)
Shiri Chechik (Tel-Aviv University)
Alina Ene (Boston University)
Yuval Filmus (Technion)
Parikshit Gopalan (Microsoft)
Roberto Grossi (Università di Pisa)
Anupam Gupta (CMU)
Yuval Ishai (Technion)
Michael Kapralov (EPFL)
Robert Kleinberg (Cornell)
Pinyan Lu (Shanghai University)
Frederic Magniez (Université Paris Diderot)
Mohammad Mahdian (Google)
Daniel Marx (Hungarian Academy of Sciences)
Danupon Nanongkai (KTH Royal Institute of Technology)
Jelani Nelson (Harvard)
Marcin Pilipczuk (University of Warsaw)
Piotr Sankowski (University of Warsaw)
Thomas Sauerwald (University of Cambridge)
Christian Scheideler (University of Paderborn)
Christian Sohler (TU Dortmund)
Kavitha Telikepalli (Indian Institute of Science)
Vinod Vaikuntanathan (MIT)
Suresh Venkatasubramanian (Utah)
László A. Végh (London School of Economics)
Thomas Vidick (Caltech)
Hoeteck Wee (ENS)
Seth Weinberg (Princeton)
Oren Weinmann (University of Haifa)


PC for track B

Anca Muscholl (Bordeaux, chair)

Pablo BARCELO (Universidad de Chile)
Achim BLUMENSATH (Masaryk University)
Thomas BRIHAYE (University of Mons)
Krishnendu CHATTERJEE (IST Austria)
Thierry COQUAND (University of Gothenburg)
Anuj DAWAR (University of Cambridge)
Jörg ENDRULLIS (Vrije Universiteit Amsterdam)
Dana FISMAN (U. Penn)
Martin HOFFMANN (LMU Munich)
Radha JAGADEESAN (De Paul University)
Stefan KIEFER (University of Oxford)
Emanuel KIERONSKI (University of Wrocław)
Stefan KREUTZER (University of Oxford)
Salvatore LA TORRE (Università di Salerno)
Antony Widjaja LIN (Yale NUS College, Singapore)
Wim MARTENS (Univ. Bayreuth)
Paul-André MELLIES (Université Paris Denis Diderot)
Luca PADOVANI (Università di Torino)
Catuscia PALAMIDESSI (INRIA Saclay & LIX )
Giovanni PIGHIZZINI (Università di Milano)
Jean-Eric PIN (IRIF)
Alexandra SILVA (University College London)
Jean-Marc TALBOT (Aix-Marseille University)
Thomas WILKE (CAU Kiel)


PC for track C

Fabian Kuhn (Albert-Ludwigs-Universität Freiburg, Germany, chair)

Ittai Abraham (VMware Research, USA)
Antonio Fernandez Anta (IMDEA Research, Spain)
James Aspnes (Yale U., USA)
Keren Censor-Hillel (Technion, Israel)
Yuval Emek (Technion, Israel)
George Giakkoupis (INRIA Rennes, France)
Seth Gilbert (National U. of Singapore)
Mohsen Ghaffari (currently at MIT, will move to ETH Zurich)
Bernhard Haeupler (CMU, USA)
Amos Korman (CNRS \& U. Paris Diderot, France)
Adrian Kosowski (INRIA, Paris)
Christoph Lenzen (MPI Saarbrücken, Germany)
Toshimitsu Masuzawa (Osaka U. Japan)
Konstantinos Panagiotou (LMU Munich, Germany)
Merav Parter (MIT)
Boaz Patt-Shamir (Tel Aviv U., Israel)
Yvonne-Anne Pigonlet (ABB Research, Switzerland)
Alessandro Panconesi (Sapienza U., Rome, Italy)
Sergio Rajsbaum (UNAM, Mexico)
Andrea Richa (Arizona State U., USA)
Hsin-Hao Su (MIT, USA)
Jukka Suomela (Aalto U., Finland)
Philipp Woelfel (U. Calgary, Canada)