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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Gąsieniec, Leszek Antoni (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Jansson, Jesper (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Levcopoulos, Christos (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2019.
• Έκδοση: 1st ed. 2019.
• Σειρά: Theoretical Computer Science and General Issues ; 11651
• Θέματα: Algorithms.; Computer graphics.; Computer science-Mathematics.; Artificial intelligence.; Data structures (Computer science).; Computer communication systems.; Algorithm Analysis and Problem Complexity.; Computer Graphics.; Discrete Mathematics in Computer Science.; Artificial Intelligence.; Data Structures.; Computer Communication Networks.

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...

Πίνακας περιεχομένων:

• Invited papers
• Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps
• Some Observations on Dynamic Random Walks and Network Renormalization
• Highly Succinct Dynamic Data Structures
• Formal methods
• Largest Common Prefix of a Regular Tree Language
• Winning Strategies for Streaming Rewriting Games
• Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting
• Two characterizations of finite-state dimension
• Complexity
• Optimal channel utilization with limited feedback
• Deterministic Preparation of Dicke States
• Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle
• On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties
• Algorithms
• An Efficient Algorithm for the Fast Delivery Problem
• Extension of some edge graph problems: standard and parameterized complexity
• Space Efficient Algorithms for Breadth-Depth Search
• Circular Pattern Matching with k Mismatches
• Succinct Representations of Finite Groups
• On the Tractability of Covering a Graph with 2-Clubs
• On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
• Maximum rectilinear convex subsets
• Computing Digraph Width Measures on Directed Co-Graphs
• Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel
• Rare Siblings Speed-up Deterministic Detection and Counting of Small Pattern Graphs
• Bivariate B-splines from convex pseudo-circle configurations
• The Fault-Tolerant Metric Dimension of Cographs.