The ICALP and the LICS steering committee have agreed together with the conference chairs in Beijing to relocate the two conferences.
ICALP and LICS 2020 will take place in Saarbrücken, Germany, July 8 - 11 2020 (with satellite workshops on July 6 - 7 2020).
The deadline is extended, see below.
__________________________________________________________________________
Call for Papers - ICALP 2020
July 8 - 11 2020, Saarbrücken, Germany
NEW Paper submission deadline: Tuesday February 18, 2020, 6am GMT
https://easychair.org/conferences/?conf=icalp2020
ICALP (International Colloquium on Automata, Languages and Programming) is the main European conference in Theoretical Computer Science and annual meeting of the European Association for Theoretical Computer Science (EATCS). ICALP 2020 will be hosted on the Saarland Informatics Campus in Saarbrücken, in co-location with LICS 2020 (ACM/IEEE Symposium on Logic in Computer Science).
Invited speakers:
Track A: Virginia Vassilevska (MIT), Robert Krauthgamer (Weizmann)
Track B: Stefan Kiefer (Oxford)
Joint ICALP-LICS: Andrew Yao (Tsinghua), Jérôme Leroux (Bordeaux)
Submission Guidelines: see https://easychair.org/conferences/?conf=icalp2020
NEW Paper submission deadline: February 18, 2020, 6am GMT
notifications: April 15, 2020
camera ready: April 28, 2020
Topics: ICALP 2020 will have the two traditional tracks
A (Algorithms, Complexity and Games - including Algorithmic Game Theory, Distributed Algorithms and Parallel, Distributed and External Memory Computing) and
B (Automata, Logic, Semantics and Theory of Programming).
(Notice that the old tracks A and C have been merged into a single track A.)
Papers presenting original, unpublished research on all aspects of theoretical computer science are sought.
Typical, but not exclusive topics are:
Track A -- Algorithmic Aspects of Networks and Networking, Algorithms for Computational Biology, Algorithmic Game Theory, Combinatorial Optimization, Combinatorics in Computer Science, Computational Complexity, Computational Geometry, Computational Learning Theory, Cryptography, Data Structures, Design and Analysis of Algorithms, Foundations of Machine Learning, Foundations of Privacy, Trust and Reputation in Network, Network Models for Distributed Computing, Network Economics and Incentive-Based Computing Related to Networks, Network Mining and Analysis, Parallel, Distributed and External Memory Computing, Quantum Computing, Randomness in Computation, Theory of Security in Networks
Track B -- Algebraic and Categorical Models, Automata, Games, and Formal Languages, Emerging and Non-standard Models of Computation, Databases, Semi-Structured Data and Finite Model Theory, Formal and Logical Aspects of Learning, Logic in Computer Science, Theorem Proving and Model Checking, Models of Concurrent, Distributed, and Mobile Systems, Models of Reactive, Hybrid and Stochastic Systems, Principles and Semantics of Programming Languages, Program Analysis and Transformation, Specification, Verification and Synthesis, Type Systems and Theory, Typed Calculi
PC Track A chair: Artur Czumaj (University of Warwick)
PC Track B chair: Anuj Dawar (University of Cambridge)
Contact
All questions about submissions should be emailed to the PC Track chairs:
Artur Czumaj A.Czumaj@warwick.ac.uk<mailto:A.Czumaj@warwick.ac.uk><mailto:A.Czumaj@warwick.ac.uk><mailto:A.Czumaj@warwick.ac.uk>
Anuj Dawar Anuj.Dawar@cl.cam.ac.uk<mailto:Anuj.Dawar@cl.cam.ac.uk><mailto:Anuj.Dawar@cl.cam.ac.uk><mailto:Anuj.Dawar@cl.cam.ac.uk>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************