Fundamentals of Computation Theory
Springer International Publishing (Verlag)
978-3-030-25026-3 (ISBN)
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.
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.
| Erscheinungsdatum | 11.07.2019 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XIII, 365 p. 267 illus., 27 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 575 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • algorithm design and optimization • Applications • Artificial Intelligence • Computational Geometry • Computer Graphics • Computer Science • conference proceedings • data structures • Graph Algorithms • graph g • Graphic methods • graph theory • Informatics • Models of Computation • planar graph • Quantum Computation • Research • vertex set |
| ISBN-10 | 3-030-25026-1 / 3030250261 |
| ISBN-13 | 978-3-030-25026-3 / 9783030250263 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
