Skip to main content
SpringerLink
Log in
Book cover

Fundamentals of Computation Theory

22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings

  • Conference proceedings
  • © 2019

Overview

Editors:
  1. Leszek Antoni Gąsieniec

    1. University of Liverpool, Liverpool, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jesper Jansson

    1. Hong Kong Polytechnic University, Hong Kong, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Christos Levcopoulos

    1. Lund University, Lund, Sweden

    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 11651)

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

Included in the following conference series:

Conference proceedings info: FCT 2019.

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 (25 papers)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  3. Formal Methods

    1. Front Matter

      Pages 47-47
      Download chapter PDF

    2. Winning Strategies for Streaming Rewriting Games

      • Christian Coester, Thomas Schwentick, Martin Schuster
      Pages 49-63

    3. Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting

      • Jesús Domínguez, Maribel Fernández
      Pages 64-79

    4. Two Characterizations of Finite-State Dimension

      • Alexander Kozachinskiy, Alexander Shen
      Pages 80-94

    5. Largest Common Prefix of a Regular Tree Language

      • Markus Lohrey, Sebastian Maneth
      Pages 95-108

  4. Complexity

    1. Front Matter

      Pages 109-109
      Download chapter PDF

    2. On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties

      • Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
      Pages 111-125

    3. Deterministic Preparation of Dicke States

      • Andreas Bärtschi, Stephan Eidenbenz
      Pages 126-139

    4. Optimal Channel Utilization with Limited Feedback

      • Gianluca De Marco, Tomasz Jurdziński, Dariusz R. Kowalski
      Pages 140-152

    5. RETRACTED CHAPTER: Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an Oracle

      • Titus Dose
      Pages 153-167

  5. Algorithms

    1. Front Matter

      Pages 169-169
      Download chapter PDF

    2. An Efficient Algorithm for the Fast Delivery Problem

      • Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos
      Pages 171-184

    3. Extension of Some Edge Graph Problems: Standard and Parameterized Complexity

      • Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
      Pages 185-200

    4. Space Efficient Algorithms for Breadth-Depth Search

      • Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti
      Pages 201-212

    5. Circular Pattern Matching with k Mismatches

      • Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński et al.
      Pages 213-228
Back to top

Other volumes

  1. Fundamentals of Computation Theory

Keywords

About this book

This book constitutes the proceedings of the 22nd International Symposium on Fundamentals of Computation Theory, FCT 2019, held in Copenhagen, Denmark, in August 2019.

The 21 full papers included in this volume were carefully reviewed and selected from 45 submissions. In addition, the book contains 3 invited talks in full-paper length. The papers were organized in topical sections named: formal methods, complexity, and algorithms.

Editors and Affiliations

  • University of Liverpool, Liverpool, UK

    Leszek Antoni Gąsieniec

  • Hong Kong Polytechnic University, Hong Kong, China

    Jesper Jansson

  • Lund University, Lund, Sweden

    Christos Levcopoulos

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation