Skip to main content
  • Conference proceedings
  • © 2017

Fundamentals of Computation Theory

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

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): FCT: International Symposium on Fundamentals of Computation Theory

Conference proceedings info: FCT 2017.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (33 papers)

  1. Front Matter

    Pages I-XXI
  2. Invited Papers

    1. Front Matter

      Pages 1-1
    2. Automata and Program Analysis

      • Thomas Colcombet, Laure Daviaud, Florian Zuleger
      Pages 3-10
  3. Contributed Papers

    1. Front Matter

      Pages 39-39
    2. Contextuality in Multipartite Pseudo-Telepathy Graph Games

      • Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix
      Pages 41-55
    3. Generalized Satisfiability Problems via Operator Assignments

      • Albert Atserias, Phokion G. Kolaitis, Simone Severini
      Pages 56-68
    4. New Results on Routing via Matchings on Graphs

      • Indranil Banerjee, Dana Richards
      Pages 69-81
    5. Energy-Efficient Fast Delivery by Mobile Agents

      • Andreas Bärtschi, Thomas Tschager
      Pages 82-95
    6. Parameterized Aspects of Triangle Enumeration

      • Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
      Pages 96-110
    7. Testing Polynomial Equivalence by Scaling Matrices

      • Markus Bläser, B. V. Raghavendra Rao, Jayalal Sarma
      Pages 111-122
    8. Strong Duality in Horn Minimization

      • Endre Boros, Ondřej Čepek, Kazuhisa Makino
      Pages 123-135
    9. Token Jumping in Minor-Closed Classes

      • Nicolas Bousquet, Arnaud Mary, Aline Parreau
      Pages 136-149
    10. Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching

      • Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, Yann Ramusat
      Pages 164-176
    11. Subquadratic Non-adaptive Threshold Group Testing

      • Gianluca De Marco, Tomasz Jurdziński, Michał Różański, Grzegorz Stachowiak
      Pages 177-189
    12. The Snow Team Problem

      • Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbańska, Paweł Żyliński
      Pages 190-203
    13. FO Model Checking on Map Graphs

      • Kord Eickmeyer, Ken-ichi Kawarabayashi
      Pages 204-216

Other Volumes

  1. Fundamentals of Computation Theory

About this book

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.

Editors and Affiliations

  • CNRS, University of Bordeaux, Talence cedex, France

    Ralf Klasing

  • LaBRI, University of Bordeaux, Talence cedex, France

    Marc Zeitoun

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access