COVID-19 update: The conference and affiliated workshops will be online-only, hosted by the University of Glasgow, UK.
Friday 12 February 2021, 23:59 AoE
Wednesday 28 April 2021
Friday 7 May 2021
Deadlines are firm; late submissions will not be considered.
Submissions and 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.
Authors are invited to submit an extended abstract of no more than 12 pages, excluding references presenting original research on the theory of computer science. All submissions must be formatted in the LIPIcs style https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ and submitted via Easychair to the appropriate track of the conference:
- for Track A (Algorithms, Complexity, and Games): https://easychair.org/conferences/?conf=icalp2021tracka
- for Track B (Automata, Logic, Semantics, and Theory of Programming): https://easychair.org/conferences/?conf=icalp2021trackb
The use of pdflatex and the LIPIcs style are mandatory: papers that deviate significantly from the required format may be rejected without consideration of merit.
No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) is allowed.
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. Authors are strongly encouraged to also make full versions of their submissions freely accessible in an on-line repository such as ArXiv, HAL, ECCC.
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.
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 and Complexity Aspects of Network Economics
- Algorithmic Aspects of Networks and Networking
- Algorithmic Aspects of Security and Privacy
- Algorithms for Computational Biology
- Algorithmic Game Theory and Mechanism Design
- Approximation and Online Algorithms
- Combinatorial Optimization
- Combinatorics in Computer Science
- Computational Complexity
- Computational Geometry
- Computational Learning Theory
- Data Structures
- Design and Analysis of Algorithms
- Distributed and Mobile Computing
- Foundations of Machine Learning
- Graph Mining and Network Analysis
- Parallel and External Memory Computing
- Quantum Computing
- Randomness in Computation
- Theoretical Foundations of Algorithmic Fairness
Track B: Automata, Logic, Semantics, and Theory of Programming
- Algebraic and Categorical Models of Computation
- Automata, Logic, and Games
- Database Theory, Constraint Satisfaction Problems, and Finite Model Theory
- Formal and Logical Aspects of Learning
- Formal and Logical Aspects of Security and Privacy
- Logic in Computer Science and Theorem Proving
- Models of Computation: Complexity and Computability
- Models of Concurrent, Distributed, and Mobile Systems
- Models of Reactive, Hybrid, and Stochastic Systems
- Principles and Semantics of Programming Languages
- Program Analysis, Verification, and Synthesis
- Type Systems and Typed Calculi