Overview
- Includes supplementary material: sn.pub/extras
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.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (33 papers)
-
Contributed Papers
Other volumes
-
Fundamentals of Computation Theory
Keywords
- 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
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
Bibliographic Information
Book Title: Fundamentals of Computation Theory
Book Subtitle: 21st International Symposium, FCT 2017, Bordeaux, France, September 11–13, 2017, Proceedings
Editors: Ralf Klasing, Marc Zeitoun
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-662-55751-8
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag GmbH Germany 2017
Softcover ISBN: 978-3-662-55750-1Published: 16 August 2017
eBook ISBN: 978-3-662-55751-8Published: 28 August 2017
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XXI, 432
Number of Illustrations: 33 b/w illustrations
Topics: Logics and Meanings of Programs, Algorithm Analysis and Problem Complexity, Computer Communication Networks, Computation by Abstract Devices, Discrete Mathematics in Computer Science, Software Engineering