Fundamentals of Computation Theory

20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings

  • Adrian Kosowski
  • Igor Walukiewicz

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

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

Table of contents

  1. Front Matter
    Pages I-XIX
  2. Invited talks

  3. Geometry, Combinatorics, Text Algorithms

    1. Front Matter
      Pages 25-25
    2. Paweł Gawrychowski, Florin Manea
      Pages 27-40
    3. Ana Paula Tomás
      Pages 41-52
    4. Mercè Claverol, Delia Garijo, Matias Korman, Carlos Seara, Rodrigo I. Silveira
      Pages 53-64
    5. Mirosław Kowaluk, Gabriela Majewska
      Pages 65-78
  4. Complexity and Boolean Functions

    1. Front Matter
      Pages 79-79
    2. Philippe Moser, Frank Stephan
      Pages 81-94
    3. N. R. Aravind, Pushkar S. Joglekar
      Pages 95-105
    4. Joan Boyar, Magnus Gausdal Find
      Pages 106-117
    5. Patrick Scharpfenecker
      Pages 118-130
  5. Languages

    1. Front Matter
      Pages 131-131
    2. Pierre Ganty, Radu Iosif
      Pages 133-145
    3. Janusz Brzozowski, Marek Szykuła
      Pages 146-159
    4. Luc Dartois, Charles Paperman
      Pages 160-172
    5. Wojciech Czerwiński, Wim Martens, Lorijn van Rooijen, Marc Zeitoun
      Pages 173-185
  6. Set Algorithms, Covering, and Traversal

    1. Front Matter
      Pages 187-187

About these proceedings


This book constitutes the refereed proceedings of the 20th International Symposium on Fundamentals of Computation Theory, FCT 2015, held in Gdańsk, Poland, in August 2015. The 27 revised full papers presented were carefully reviewed and selected from 60 submissions. The papers cover topics in three main areas: algorithms, formal methods, and emerging fields and are organized in topical sections on geometry, combinatorics, text algorithms; complexity and Boolean functions; languages; set algorithms, covering, and traversal; graph algorithms and networking applications; anonymity and indistinguishability; graphs, automata, and dynamics; and logic and games.


Algorithm design Approximation Automata and formal languages Cloud computing Combinatorics Computational biology Computational complexity Computational geometry Distributed computing Evolving systems Formal methods Hybrid systems Logics Model checking Online algorithms Optimization Parallel computing Quantum computing Ubiquitous systems Verification

Editors and affiliations

  • Adrian Kosowski
    • 1
  • Igor Walukiewicz
    • 2
  1. 1.Université Paris DiderotParisFrance
  2. 2.Université Bordeaux 1TalenceFrance

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing Switzerland 2015
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-22176-2
  • Online ISBN 978-3-319-22177-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Finance, Business & Banking
IT & Software
Energy, Utilities & Environment