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

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

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

Important dates

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

Deadlines are firm; late submissions will not be considered.


ICALP proceedings are published in the Springer-Verlag ARCoSS (Advanced Research in Computing and Software Science) subseries of LNCS (Lecture Notes in Computer Science).

Invited Speakers

Keynote Speakers

Invited Tutorial Speakers (Joint with LICS)

Masterclass speaker

Submission Guidelines

Authors are invited to submit an extended abstract of no more than 12 pages, including references, in LNCS style presenting original research on the theory of Computer Science. All submissions will be electronic via the EasyChair page for the conference, with three tracks (A, B and C):
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. Submissions must adhere to the specified format and length. Submissions that are too long or formatted incorrectly may be rejected immediately. All the technical details that are necessary for a proper scientific evaluation of a submission must be included in a clearly-labelled appendix, to be consulted at the discretion of program committee members. This includes, in particular, the proofs of all the key theorems in a paper.

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.


Conference Chair: Kazuo Iwama, Kyoto University

Program Chairs

Track A: Bettina Speckmann, TU Eindhoven, The Netherlands
Track B: Naoki Kobayashi, The University of Tokyo, Japan
Track C: Magnus M. Halldorsson, Reykjavik University, Iceland

Program Committees

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