ICALP 2016 Call for Papers

by , under Events

ICALP 2016

The 43rd International Colloquium on Automata, Languages, and Programming (ICALP) will take place in Rome, Italy, on July 11-15, 2016.

ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). As usual, ICALP will be preceded by a series of workshops, which will take place on July 11.

Important dates

Submission deadline: Wednesday, February 17, 2016, 23:59 PST (Pacific Standard Time, UTC-8)
Author notification: April 15, 2016
Final manuscript due: April 30, 2016

Deadlines are firm; late submissions will not be considered.


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

Subhash Khot (New York University, USA)
Marta Z. Kwiatkowska (University of Oxford, UK)
Xavier Leroy (INRIA, France)
Devavrat Shah (MIT, USA)


Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are:

Track A: Algorithms, Complexity and Games

* Algorithmic Game Theory
* Approximation Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Biology
* Computational Complexity
* Computational Geometry
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Machine Learning
* Parallel, Distributed and External Memory Computing
* Randomness in Computation
* Quantum Computing

Track B: Logic, Semantics, Automata and Theory of Programming

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

Track C: Foundations of Networked Computation:
Models, Algorithms and Information Management

* Algorithmic Aspects of Networks and Networking
* Formal Methods for Network Information Management
* Foundations of Privacy, Trust and Reputation in Networks
* Mobile and Wireless Networks and Communication
* Network Economics and Incentive-Based Computing Related to Networks
* Networks of Low Capability Devices
* Network Mining and Analysis
* Overlay Networks and P2P Systems
* Specification, Semantics, Synchronization of Networked Systems
* Theory of Security in Networks

Submission Guidelines

Authors are invited to submit an extended abstract of no more than 12 pages, excluding references, in the LIPIcs style (http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/) presenting original research on the theory of Computer Science. The usage of pdflatex and the LIPIcs style file (see http://11011110.livejournal.com/300115.html for some formatting tricks) are mandatory: papers that deviate significantly from the required format may be rejected without consideration of merit.

All submissions will be electronic via EasyChair:


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.

All the technical details necessary for a proper scientific 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.

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.


Track A: Algorithms, complexity, and games

Yuval Rabani (The Hebrew University of Jerusalem, Israel, Chair)
Susanne Albers (TU Munchen, Germany)
Andris Ambainis (University of Latvia, Latvia)
Per Austrin (KTH Royal Institute of Technology, Sweden)
Harry Buhrman (Centrum Wiskunde & Informatica, Netherlands)
Elisa Celis (EPFL, Switzerland)
Nicolo’ Cesa-Bianchi (University of Milano, Italy)
Marek Cygan (University of Warsaw, Poland)
Ilias Diakonikolas (University of Edinburgh, Scotland)
Josep Diaz (University Polytechnica de Catalunya, Spain)
Benjamin Doerr (Ecole Polytechnique, France)
Dimitris Fotakis (NTUA, Greece)
Anna Gal (University of Texas at Austin, USA)
Cyril Gavoille (University of Bordeaux, France)
Fabrizio Grandoni (USI, Switzerland)
Iftach Haitner (Tel Aviv University, Israel)
Monika Henzinger (University of Vienna, Austria)
Rahul Jain (National University of Singapore, Singapore)
Ken-Ichi Kawarabayashi (National Institute of Informatics, Japan)
Piotr Krysta (University of Liverpool, UK)
Francois Le Gall (University of Tokyo, Japan)
Stefano Leonardi (Sapienza University of Rome, Italy)
Jian Li (Tsinghua University, China)
Nutan Limaye (Indian Institute of Technology, India)
Satya Lokam (Microsoft Research, India)
Raghu Meka (UCLA, USA)
Lorenzo Orecchia (Boston University, USA)
Rotem Oshman (Tel Aviv University, Israel)
Giuseppe Persiano (University of Salerno, Italy)
Nikhil Srivastava (University of California, Berkeley, USA)
Mikkel Thorup (University of Copenhagen, Denmark)
Dominique Unruh (University of Tartu, Estonia)
Justin Ward (University of Warwick, UK)

Track B: Logic, semantics, automata and theory of Programming

Davide Sangiorgi (University of Bologna, Italy, Chair)
Parosh Aziz Abdulla (University of Uppsala, Sweden)
Tomas Brazdil (Masaryk University, Czech Republic)
Arnaud Carayol (CNRS, Marne-La-Vallee, France)
Taolue Chen (University of Oxford, UK)
Silvia Crafa (University of Padova, Italy)
Loris D’Antoni (University of Pennsylvania, USA)
Pedro D’Argenio (Universidad Nacional de Cordoba, Argentina)
Yuxin Deng (East China Normal University, Shanghai, China)
Maribel Fernandez (King’s College London, UK)
Matthew Hague (University of London, UK)
Anna Ingolfsdottir (Reykjavik University, Iceland)
Jarkko Kari (University of Turku, Finland)
Joost-Pieter Katoen (Aachen University, Germany)
Barbara Konig (University Duisburg-Essen, Germany)
Bartek Klin (University of Warsaw, Poland)
Parthasarathy Madhusudan (University of Illinois, USA)
Massimo Merro (University of Verona, Italy)
Stephan Merz (Inria Nancy, France)
Madhavan Mukund (Chennai Mathematical Institute, India)
Filip Murlak (University of Warsaw, Poland)
Aleksandar Nanevski (Madrid Institute of Advanced Studies, Spain)
C.-H. Luke Ong (University of Oxford, UK)
Jorge A. Perez (University of Groningen, Netherlands)
Damien Pous (ENS de Lyon, France)
Jakob Rehof (TU Dortmund, Germany)
Tachio Terauchi (JAIST, Japan)

Track C: Foundations of networked computation:
Models, algorithms and information management

Michael Mitzenmacher (Harvard University, USA, Chair)
Luca Becchetti (Sapienza University of Rome, Italy)
Shuchi Chawla (University of Wisconsin – Madison, USA)
Krishnendu Chatterjee (IST, Austria)
Lap Chi Lau (Chinese University Hong Kong/Waterloo)
Flavio Chierichetti (Sapienza University of Rome, Italy)
Graham Cormode (University of Warwick, UK)
Edith Elkind (University of Oxford, UK)
Keren-Censor Hillel (Technion, Israel)
Martin Hoefer (MPI, Germany)
Valerie King (University of Victoria, Canada)
Marc LeLarge (INRIA, France)
Katrina Liggett (Caltech, USA)
Cris Moore (Santa Fe Institute, USA)
Thomas Moscibroda (Microsoft Research, China)
Rasmus Pagh (ITU, Denmark)
Rajmohan Rajaraman (Northeastern University, USA)
Aaron Roth (University of Pennsylvania, USA)
Justin Thaler (Yahoo Labs, USA)
Udi Wieder (VMware Research, USA)