Skip to main content
SpringerLink
Log in
Book cover

Fundamentals of Computation Theory

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

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. Ralf Klasing

    1. CNRS, University of Bordeaux, Talence cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Marc Zeitoun

    1. LaBRI, University of Bordeaux, Talence cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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)

Included in the following conference series:

Conference proceedings info: FCT 2017.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (33 papers)

  1. Front Matter

    Pages I-XXI
    Download chapter PDF

  2. Invited Papers

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Automata and Program Analysis

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

    3. What One Has to Know When Attacking \(\textsf {P}\) vs. \(\textsf {NP}\) (Extended Abstract)

      • Juraj Hromkovič, Peter Rossmanith
      Pages 11-28

    4. A Tour of Recent Results on Word Transducers

      • Anca Muscholl
      Pages 29-33

    5. Some Results of Zoltán Ésik on Regular Languages

      • Jean-Éric Pin
      Pages 34-37

  3. Contributed Papers

    1. Front Matter

      Pages 39-39
      Download chapter PDF

    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. Expressive Power of Evolving Neural Networks Working on Infinite Input Streams

      • Jérémie Cabessa, Olivier Finkel
      Pages 150-163

    11. 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

    12. Subquadratic Non-adaptive Threshold Group Testing

      • Gianluca De Marco, Tomasz Jurdziński, Michał Różański, Grzegorz Stachowiak
      Pages 177-189

    13. The Snow Team Problem

      • Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbańska, Paweł Żyliński
      Pages 190-203

    14. FO Model Checking on Map Graphs

      • Kord Eickmeyer, Ken-ichi Kawarabayashi
      Pages 204-216
Back to top

Other volumes

  1. Fundamentals of Computation Theory

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation