Fundamentals of Computation Theory

17th International Symposium, FCT 2009, Wrocław, Poland, September 2-4, 2009. Proceedings

  • Mirosław Kutyłowski
  • Witold Charatonik
  • Maciej Gębala
Conference proceedings FCT 2009
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5699)

Table of contents

  1. Front Matter
  2. Invited Lectures

    1. Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
      Pages 3-13
  3. Contributions

    1. Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer
      Pages 14-25
    2. Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi
      Pages 26-37
    3. John Case, Samuel E. Moelius III
      Pages 38-49
    4. Pietro Cenciarelli, Daniele Gorla, Ivano Salvo
      Pages 50-61
    5. Colin Cooper, Andrew R. A. McGrae, Michele Zito
      Pages 74-83
    6. Adrian Diaconu, Florin Manea, Cătălin Tiseanu
      Pages 96-108
    7. Olivier Gauwin, Joachim Niehren, Sophie Tison
      Pages 121-132
    8. Viliam Geffert, Jozef Gajdoš
      Pages 133-144
    9. Subhas Kumar Ghosh, Koushik Sinha
      Pages 145-156
    10. Andreas Goerdt
      Pages 157-168
    11. Erich Grädel, Łukasz Kaiser, Roman Rabinovich
      Pages 169-180
    12. Paul Hänsch, Michaela Slaats, Wolfgang Thomas
      Pages 181-192
    13. Pim van ’t Hof, Daniël Paulusma, Johan M. M. van Rooij
      Pages 193-204

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 17th International Symposium Fundamentals of Computation Theory, FCT 2009, held in Wroclaw, Poland in August 2009.

The 29 revised full papers were carefully reviewed and selected from 67 submissions. The papers address all current topics in computation theory such as automata and formal languages, design and analysis of algorithms, computational and structural complexity, semantics, logic, algebra and categories in computer science, circuits and networks, learning theory, specification and verification, parallel and distributed systems, concurrency theory, cryptography and cryptograhic protocols, approximation and randomized algorithms, computational geometry, quantum computation and information, bio-inspired computation.

Keywords

algorithms automata automata theory category theory complexity complexity theory computational geometry fundamentals game theory graph theory logic np-hard theoretical computer science turing machine vertex cover

Editors and affiliations

  • Mirosław Kutyłowski
    • 1
  • Witold Charatonik
    • 2
  • Maciej Gębala
    • 1
  1. 1.Institute of Mathematics and Computer ScienceWrocław University of TechnologyWrocławPoland
  2. 2.Institute of Computer ScienceUniversity of WrocławWrocławPoland

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-03409-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-03408-4
  • Online ISBN 978-3-642-03409-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book