FCT 2021

23rd International Symposium on
Fundamentals of Computation Theory
September 12-15, 2021, Athens, Greece (virtually)

Overview

    FCT, the International Symposia on Fundamentals of Computation Theory was established in 1977 as a forum for researchers interested in all aspects of theoretical computer science, and in particular algorithms, complexity, formal and logical methods. It is a biennial series of conferences previously held in Poznan (Poland, 1977), Wendisch-Rietz (Germany, 1979), Szeged (Hungary, 1981), Borgholm (Sweden, 1983), Cottbus (Germany, 1985), Kazan (Russia, 1987), Szeged (Hungary, 1989), Gosen-Berlin (Germany, 1991), Szeged (Hungary, 1993), Dresden (Germany, 1995), Krakow (Poland, 1997), Iasi (Romania, 1999), Riga (Latvia, 2001), Malmö (Sweden, 2003), Lübeck (Germany, 2005), Budapest (Hungary, 2007), Wroclaw (Poland, 2009), Oslo (Norway, 2011), Liverpool (United Kingdom, 2013), Gdansk (Poland, 2015), Bordeaux (France, 2017), and Copenhagen (Denmark, 2019).
    FCT 2021 has been hosted by the National Technical University of Athens virtually, due to the covid-19 pandemic. The next FCT 2023 conference will take place in Trier.

Important Dates

  • Abstract submission: May 9 May 16, 2021 (AoE) ** EXTENDED **
  • Full-paper submission: May 16 May 23, 2021 (AoE) ** EXTENDED **
  • Notification to authors: June 28, 2021
  • Camera-ready: July 6 11, 2021
  • Symposium: September 12-15, 2021

Topics of interest

    We welcome original, significant research contributions to the fundamentals of computation theory, including (but not limited to) the following topics:

    Algorithms

    • algorithm design and optimization
    • data structures
    • combinatorics and analysis of algorithms
    • randomized algorithms
    • approximation algorithms
    • parameterized and exact algorithms
    • computational algebra and number theory
    • computational geometry
    • parallel algorithms
    • distributed algorithms and protocols
    • online algorithms
    • streaming algorithms
    • algorithmic game theory
    • computational foundations of machine learning
    • computational biology

    Complexity

    • models of computation
    • computational complexity
    • decidability
    • Boolean/algebraic circuits and functions
    • randomized computation
    • derandomization
    • interactive proofs
    • computational foundations of cryptography
    • quantum computation
    • complexity theory
    • lower bounds
    • counting complexity

    Formal methods

    • algebraic and categorical methods
    • automata and formal languages
    • database theory
    • foundations of concurrency and distributed systems
    • logic and model checking
    • models of reactive, hybrid, and stochastic systems
    • principles of programming languages
    • program analysis and transformation
    • security
    • specification, refinement, and verification
    • type systems
    • ad hoc, dynamic, and evolving systems
    • foundations of cloud computing and ubiquitous systems

Invited Speakers

  • Constantinos Daskalakis, Massachusetts Institute of Technology
  • Daniel Marx, Max Planck Institute for Informatics
  • Claire Mathieu, CNRS and University of Paris
  • Nobuko Yoshida, Imperial College London

Accepted Papers

    The list of accepted papers can be found here.

Tutorial

    A tutorial will be given on Sunday, September 12, by David Richerby, University of Essex, on the Complexity of Counting Problems. For more details please see here.

Young Researchers' Forum

    The Young Researchers’ Forum aims to serve as an informal meeting for young researchers to present their work to a wider audience and receive feedback from peers and senior scientists. It will take place on Sunday, September 12, 17:00-18:30 Athens time. Presentations will be short and will be selected through a light, abstract-based reviewing process. Abstracts of selected presentations will appear on the conference's website. Young researchers interested in presenting recent or ongoing work in the Forum should send a title and abstract to fct2021_at_corelab_dot_ntua_dot_gr by September 9.

Submissions (closed)

    Authors are invited to submit high-quality manuscripts reporting original unpublished research in the topics related to the symposium. Simultaneous submission to other conferences or workshops with published proceedings is not allowed. It is required that each accepted paper be presented at the conference by one of its authors. Submissions must not exceed 12 pages (excluding references), formatted according to LNCS LaTeX template and style files, plus an optional, clearly marked appendix of reasonable length (to be read at the program committee's discretion). The first page must include an indication of whether the paper is eligible for the best student paper award. Papers are to be submitted electronically through EasyChair via this link.

Awards

    Awards will be given to the best paper and the best student paper. To be eligible for the best student paper award, at least one of the paper authors must be a full-time student at the time of submission, and the student(s) must have made a significant contribution to the paper. The awards are sponsored by Springer.

Proceedings

    Symposium proceedings will be published in the ARCoSS subline of the Springer Lecture Notes in Computer Science [LNCS] series, volume 12867.
    The proceedings ebook (ISBN: 978-3-030-86593-1) can be accessed using this link: https://link.springer.com/book/10.1007/978-3-030-86593-1
    Proceedings of earlier FCT conferences can be found here.

Special Issue

    Selected papers will be invited to a special issue of the Journal of Computer and System Sciences [JCSS], devoted to FCT 2021.

Program Committee

  • Evripidis Bampis (co-chair), Sorbonne University
  • Petra Berenbrink, University of Hamburg
  • Arnaud Casteigts, University of Bordeaux
  • Marek Chrobak, UC Riverside
  • Hans van Ditmarsch, CNRS and University of Lorraine
  • Thomas Erlebach, University of Leicester
  • Bruno Escoffier, Sorbonne University
  • Henning Fernau, University of Trier
  • Dimitris Fotakis, National Technical University of Athens
  • Pierre Fraigniaud, CNRS and University of Paris
  • Leszek Gasieniec, University of Liverpool and Augusta University
  • Laurent Gourves, CNRS and Paris Dauphine University
  • Giuseppe F. Italiano, LUISS Guido Carli University
  • Ralf Klasing, CNRS and University of Bordeaux
  • Alexander Kononov, Sobolev Institute of Mathematics and Novosibirsk State University
  • Antonin Kucera, Masaryk University
  • Dietrich Kuske, TU Ilmenau
  • Nikos Leonardos, National and Kapodistrian University of Athens
  • Minming Li, City University of Hong Kong
  • Zsuzsanna Liptak, University of Verona
  • Giorgio Lucarelli, University of Lorraine
  • Vangelis Markakis, Athens University of Economics and Business
  • Nicole Megow, University of Bremen
  • Andrzej Murawski, University of Oxford
  • Aris Pagourtzis (co-chair), National Technical University of Athens
  • Charis Papadopoulos, University of Ioannina
  • Igor Potapov, University of Liverpool
  • Tomasz Radzik, King's College London
  • Maria Serna, Technical University of Catalonia
  • Hadas Shachnai, Technion
  • Vorapong Suppakitpaisarn, University of Tokyo
  • Nikos Tzevelekos, Queen Mary University of London
  • Guochuan Zhang, Zhejiang University

Organizing Committee

  • Dimitris Fotakis (co-chair), National Technical University of Athens
  • Nikos Leonardos, National and Kapodistrian University of Athens
  • Thanasis Lianeas, National Technical University of Athens
  • Aris Pagourtzis (co-chair), National Technical University of Athens

Steering Committee

  • Bogdan Chlebus, Augusta University
  • Marek Karpinski (chair), University of Bonn
  • Andrzej Lingas, Lund University
  • Miklos Santha, CNRS and University Paris Diderot
  • Eli Upfal, Brown University

Local Arrangements

  • Antonis Antonopoulos
  • Pouran Behrouz
  • Aggeliki Chalki
  • Alkis Kalavasis
  • Ioannis Papaioannou
  • Panagiotis Patsilinakos
  • Ioanna Protekdikou

    • Contact: fct2021_at_corelab.ntua.gr
NTUA_ECE
ICCS
SPRINGER

SPRINGER
SPRINGER