LEADER 04809nam 22007815 450 001 9910349307903321 005 20240523222255.0 010 $a3-030-25027-X 024 7 $a10.1007/978-3-030-25027-0 035 $a(CKB)4100000008878242 035 $a(DE-He213)978-3-030-25027-0 035 $a(MiAaPQ)EBC5923279 035 $a(PPN)238488519 035 $a(EXLCZ)994100000008878242 100 $a20190709d2019 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFundamentals of Computation Theory $e22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings /$fedited by Leszek Antoni G?sieniec, Jesper Jansson, Christos Levcopoulos 205 $a1st ed. 2019. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019. 215 $a1 online resource (XIII, 365 p. 266 illus., 27 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11651 311 $a3-030-25026-1 320 $aIncludes bibliographical references and index. 327 $aInvited 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11651 606 $aAlgorithms 606 $aComputer graphics 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence 606 $aArtificial intelligence?Data processing 606 $aComputer networks 606 $aAlgorithms 606 $aComputer Graphics 606 $aDiscrete Mathematics in Computer Science 606 $aArtificial Intelligence 606 $aData Science 606 $aComputer Communication Networks 615 0$aAlgorithms. 615 0$aComputer graphics. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer networks. 615 14$aAlgorithms. 615 24$aComputer Graphics. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aArtificial Intelligence. 615 24$aData Science. 615 24$aComputer Communication Networks. 676 $a004.015113 676 $a004 702 $aGa?sieniec$b Leszek$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJansson$b Jesper$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLevcopoulos$b Christos$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910349307903321 996 $aFundamentals of Computation Theory$92557870 997 $aUNINA