1 option
Fundamentals of Computation Theory : 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings / edited by Leszek Antoni Gąsieniec, Jesper Jansson, Christos Levcopoulos.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 11651
- Theoretical Computer Science and General Issues, 2512-2029 ; 11651
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer graphics.
- Computer science-Mathematics.
- Discrete mathematics.
- Artificial intelligence.
- Artificial intelligence-Data processing.
- Computer networks.
- Computer Graphics.
- Discrete Mathematics in Computer Science.
- Artificial Intelligence.
- Data Science.
- Computer Communication Networks.
- Local Subjects:
- Algorithms.
- Computer Graphics.
- Discrete Mathematics in Computer Science.
- Artificial Intelligence.
- Data Science.
- Computer Communication Networks.
- Physical Description:
- 1 online resource (XIII, 365 pages) : 266 illustrations, 27 illustrations in color.
- Edition:
- 1st ed. 2019.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2019.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-25027-0
- 9783030250270
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.