Fundamentals of Computation Theory

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

AvLeszek Antoni Gąsieniec,Jesper Jansson

Häftad, Engelska, 2019

Del 11651 i serien Lecture Notes in Computer Science

535 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2019-07-10
Mått:155 x 235 x 21 mm
Vikt:581 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:365
Upplaga:19001
Förlag:Springer Nature Switzerland AG
ISBN:9783030250263

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

Innehållsförteckning

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