default search action
22nd FCT 2019: Copenhagen, Denmark
- Leszek Antoni Gasieniec, Jesper Jansson, Christos Levcopoulos
:
Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings. Lecture Notes in Computer Science 11651, Springer 2019, ISBN 978-3-030-25026-3
Invited Papers
- Libor Barto
Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps. 3-17 - Bernard Chazelle
Some Observations on Dynamic Random Walks and Network Renormalization. 18-28 - Torben Hagerup
Highly Succinct Dynamic Data Structures. 29-45
Formal Methods
- Christian Coester
Winning Strategies for Streaming Rewriting Games. 49-63 - Jesús Domínguez
Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting. 64-79 - Alexander Kozachinskiy
Two Characterizations of Finite-State Dimension. 80-94 - Markus Lohrey, Sebastian Maneth:
Largest Common Prefix of a Regular Tree Language. 95-108
Complexity
- Vikraman Arvind, Frank Fuhlbrück
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties. 111-125 - Andreas Bärtschi
Deterministic Preparation of Dicke States. 126-139 - Gianluca De Marco, Tomasz Jurdzinski
Optimal Channel Utilization with Limited Feedback. 140-152 - (Withdrawn) Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an Oracle. 153-167
Algorithms
- Iago A. Carvalho
An Efficient Algorithm for the Fast Delivery Problem. 171-184 - Katrin Casel, Henning Fernau
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. 185-200 - Sankardeep Chakraborty, Anish Mukherjee
Space Efficient Algorithms for Breadth-Depth Search. 201-212 - Panagiotis Charalampopoulos
Circular Pattern Matching with k Mismatches. 213-228 - Bireswar Das, Shivdutt Sharma
Succinct Representations of Finite Groups. 229-242 - Riccardo Dondi, Manuel Lafond:
On the Tractability of Covering a Graph with 2-Clubs. 243-257 - Carl Feghali
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. 258-273 - Hernán González-Aguilar, David Orden
Maximum Rectilinear Convex Subsets. 274-291 - Frank Gurski
Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract). 292-305 - Marek Klonowski, Dariusz R. Kowalski, Jaroslaw Mirek, Prudence W. H. Wong:
Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel. 306-321 - Miroslaw Kowaluk, Andrzej Lingas:
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. 322-334 - Dominique Schmitt:
Bivariate B-Splines from Convex Pseudo-circle Configurations. 335-349 - Duygu Vietz
The Fault-Tolerant Metric Dimension of Cographs. 350-364
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-15 01:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: