Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings

Description

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.

Table of Contents

1. 1. Front Matter
2. Invited Papers
   1. Front Matter
   2. Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps
   3. Some Observations on Dynamic Random Walks and Network Renormalization
   4. Highly Succinct Dynamic Data Structures
3. Formal Methods
   1. Front Matter
   2. Winning Strategies for Streaming Rewriting Games
   3. Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting
   4. Two Characterizations of Finite-State Dimension
   5. Largest Common Prefix of a Regular Tree Language
4. Complexity
   1. Front Matter
   2. On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties
   3. Deterministic Preparation of Dicke States
   4. Optimal Channel Utilization with Limited Feedback
   5. RETRACTED CHAPTER: Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an Oracle
5. Algorithms
   1. Front Matter
   2. An Efficient Algorithm for the Fast Delivery Problem
   3. Extension of Some Edge Graph Problems: Standard and Parameterized Complexity
   4. Space Efficient Algorithms for Breadth-Depth Search
   5. Circular Pattern Matching with k Mismatches
   6.  Succinct Representations of Finite Groups
   7. On the Tractability of Covering a Graph with 2-Clubs
   8. On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
   9. Maximum Rectilinear Convex Subsets
   10. Computing Digraph Width Measures on Directed Co-graphs
   11. Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel
   12. Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
   13. Bivariate B-Splines from Convex Pseudo-circle Configurations
   14. The Fault-Tolerant Metric Dimension of Cographs
   15. Retraction Note to: Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an Oracle
   16. Back Matter

Editors Biography

Leszek Antoni Gąsieniec
University of Liverpool, Liverpool, UK

Jesper Jansson
Hong Kong Polytechnic University, Hong Kong, China

Christos Levcopoulos
Lund University, Lund, Sweden