Fundamentals of computation theory : 22nd International Symposium, FCT 2019, Copenhagen, Demark, August 12-14, 2019, Proceedings /: 22nd International Symposium, FCT 2019, Copenhagen, Demark, August 12-14, 2019, Proceedings. ([2019])
- Record Type:
- Book
- Title:
- Fundamentals of computation theory : 22nd International Symposium, FCT 2019, Copenhagen, Demark, August 12-14, 2019, Proceedings /: 22nd International Symposium, FCT 2019, Copenhagen, Demark, August 12-14, 2019, Proceedings. ([2019])
- Main Title:
- Fundamentals of computation theory : 22nd International Symposium, FCT 2019, Copenhagen, Demark, August 12-14, 2019, Proceedings
- Other Titles:
- FCT 2019
- Further Information:
- Note: Leszek Antoni Gąsieniec, Jesper Jansson, Christos Levcopoulos (eds.).
- Editors:
- Gąsieniec, Leszek
Jansson, Jesper
Levcopoulos, Christos - Other Names:
- FCT (Symposium), 22nd
- 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-circleInvited 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. … (more)
- Publisher Details:
- Cham : Springer
- Publication Date:
- 2019
- Copyright Date:
- 2019
- Extent:
- 1 online resource, illustrations (some color)
- Subjects:
- 004
Computer science -- Congresses
Computer science -- Mathematics -- Congresses
Conference papers and proceedings
Electronic books - Languages:
- English
- ISBNs:
- 9783030250270
- Related ISBNs:
- 303025027X
9783030250263 - Notes:
- Note: Includes bibliographical references and index.
Note: Online resource; title from PDF title page (SpringerLink, viewed August 29, 2019). - Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.444457
- Ingest File:
- 02_572.xml