**********************************************************************************
MFCS 2021 - 2nd Call for Papers
The 46th International Symposium on Mathematical Foundations of Computer
Science
August 23-27, 2021, Tallinn, Estonia
https://compose.ioc.ee/mfcs/
**********************************************************************************
CALL FOR PAPERS
The MFCS conference series has been organised since 1972. Traditionally,
the conference moved between the Czech Republic, Slovakia, and Poland,
while since 2013, the conference travels around Europe. In 2021, it will
come to Tallinn, Estonia. MFCS is a high quality venue for original
research in all branches of theoretical computer science.
IMPORTANT DATES
Abstract Deadline: Thursday, April 30, 2021 (AoE)
Submission Deadline: Monday, May 3, 2021 (AoE)
Notification: Monday, June 21, 2021
Conference: Monday August 23 to Friday August 27, 2021
SUBMISSION GUIDELINES
Papers should be submitted electronically through EasyChair at
https://easychair.org/conferences/?conf=mfcs2021
Submissions should be formatted using the LIPIcs style with length not
exceeding 12 pages (excluding references and an optional appendix).
References and an optional appendix can go beyond the 12 pages (the
appendix will be consulted at the discretion of the program committee). It
is mandatory to use the LIPIcs style for submissions.
No prior publication or simultaneous submission to other conferences or
journals are allowed (except preprint repositories such as arXiv or
workshops without formal published proceedings).
PUBLICATION
MFCS 2021 proceedings will be published in LIPIcs (Leibniz International
Proceedings in Informatics) under an open source license (as in previous
years).
LIST OF TOPICS
We encourage submission of original research papers in all areas of
theoretical computer science, including (but not limited to) the following:
- algebraic and co-algebraic methods in computer science
- algorithms and data structures
- automata and formal languages
- bioinformatics
- combinatorics on words, trees, and other structures
- computational complexity (structural and model-related)
- computational geometry
- computer-aided verification
- computer
- assisted reasoning
- concurrency theory
- cryptography and security
- cyber physical systems, databases and knowledge-based systems
- formal specifications and program development
- foundations of computing
- logics in computer science
- mobile computing
- models of computation
- networks
- parallel and distributed computing
- quantum computing
- semantics and verification of programs
- theoretical issues in artificial intelligence and machine learning
- types in computer science
PROGRAM COMMITTEE
Filippo Bonchi (University of Pisa, co-chair)
Tiziana Calamoneri (Sapienza University of Rome)
Corina Cirstea (University of Southampton)
Laure Daviaud (City, University of London)
Vida Dujmovic (University of Ottawa )
Leah Epstein (University of Haifa)
Henning Fernau (University of Trier)
Pawel Gawrychowski (University of Wroclaw)
Petteri Kaski (Aalto University)
Telikepalli Kavitha (Tata Institute of Fundamental Research, Mumbai)
Stefan Kiefer (University of Oxford)
Aleks Kissinger (University of Oxford)
Christian Komusiewicz (Philipps-Universitaet Marburg)
Lukasz Kowalik (Institute of Informatics, University of Warsaw)
Daniel Kral' (Masaryk University)
Oded Lachish (Birkbeck, University of London)
Sophie Laplante (IRIF, Universite Paris Diderot Paris 7)
Daniel Lokshtanov (UCSB)
Giulio Manzonetto (LIPN, Universite Paris-Nord)
Nicole Megow (Universitaet Bremen)
Stefan Milius (FAU Erlangen)
Matteo Mio (CNRS/ENS-Lyon)
Koko Muroya (RIMS, Kyoto University)
Eunjin Oh (POSTECH)
Yoshio Okamoto (The University of Electro-Communications)
Neil Olver (London School of Economics and Political Science)
Diana Piguet (Czech Academy of Sciences)
Nadia Pisanti (University of Pisa)
Simon Puglisi (University of Helsinki, co-chair)
Rajeev Raman (University of Leicester)
Francesco Ranzato (University of Padova)
Peter Rossmanith (RWTH Aachen University)
Jurriaan Rot (Radboud University)
Laura Sanita (University of Waterloo)
Shikha Singh (Williams College)
Ana Sokolova (University of Salzburg)
David Spivak II (MIT)
Tatiana Starikovskaya (Ecole Normale Superieure)
Szymon Torunczyk (University of Warsaw)
Ryuhei Uehara (Japan Advanced Institute of Science and Technology)
Prudence Wong (University of Liverpool)
Meirav Zehavi (Ben-Gurion University)
Valeria de Paiva (Samsung Research America and University of Birmingham)
ORGANIZING COMMITTEE
Pawel Sobocinski (chair).
INVITED SPEAKERS (confirmed):
Amina Doumane (ENS Lyon)
Martin Grohe (RWTH Aachen University)
Joel Ouaknine (Max Planck Institute for Software Systems)
Eva Rotenberg (Technical University of Denmark)
**********************************************************
*
* 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/
*
**********************************************************