© 2017

Fundamentals of Computation Theory

21st International Symposium, FCT 2017, Bordeaux, France, September 11–13, 2017, Proceedings

  • Ralf Klasing
  • Marc Zeitoun
Conference proceedings FCT 2017

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10472)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 10472)

Table of contents

  1. Front Matter
    Pages I-XXI
  2. Invited Papers

    1. Front Matter
      Pages 1-1
    2. Thomas Colcombet, Laure Daviaud, Florian Zuleger
      Pages 3-10
  3. Contributed Papers

    1. Front Matter
      Pages 39-39
    2. Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix
      Pages 41-55
    3. Albert Atserias, Phokion G. Kolaitis, Simone Severini
      Pages 56-68
    4. Indranil Banerjee, Dana Richards
      Pages 69-81
    5. Andreas Bärtschi, Thomas Tschager
      Pages 82-95
    6. Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
      Pages 96-110
    7. Markus Bläser, B. V. Raghavendra Rao, Jayalal Sarma
      Pages 111-122
    8. Endre Boros, Ondřej Čepek, Kazuhisa Makino
      Pages 123-135
    9. Nicolas Bousquet, Arnaud Mary, Aline Parreau
      Pages 136-149
    10. Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, Yann Ramusat
      Pages 164-176
    11. Gianluca De Marco, Tomasz Jurdziński, Michał Różański, Grzegorz Stachowiak
      Pages 177-189
    12. Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbańska, Paweł Żyliński
      Pages 190-203
    13. Kord Eickmeyer, Ken-ichi Kawarabayashi
      Pages 204-216

About these proceedings


This book constitutes the refereed proceedings of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017, held in Bordeaux, France, in September 2017. The 29 revised full papers and 5 invited papers presented were carefully reviewed and selected from 99 submissions. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.


theoretical computer science algorithms complexity formal and logical methods automata and formal languages cloud computing computational complexity model checking ubiquitous systems algorithm design approximation combinatorics computational biology computational geometry distributed computing evolving systems formal methods hybrid systems logics online algorithms

Editors and affiliations

  • Ralf Klasing
    • 1
  • Marc Zeitoun
    • 2
  1. 1.CNRSUniversity of BordeauxTalence cedexFrance
  2. 2.LaBRIUniversity of BordeauxTalence cedexFrance

Bibliographic information