Call for papers
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
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.
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.