default search action
24th FCT 2023: Trier, Germany
- Henning Fernau
, Klaus Jansen
Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings. Lecture Notes in Computer Science 14292, Springer 2023, ISBN 978-3-031-43586-7 - Samy Abbes
Convergence of Distributions on Paths. 1-15 - Antonio Al Serhali, Joachim Niehren:
Subhedge Projection for Stepwise Hedge Automata. 16-31 - Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara:
The Rectilinear Convex Hull of Line Segments. 32-45 - Nathalie Aubrun
Domino Snake Problems on Groups. 46-59 - Martin Berglund
Parsing Unranked Tree Languages, Folded Once. 60-73 - Johanna Björklund
The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited. 74-87 - Nick Brettell
Computing Subset Vertex Covers in H-Free Graphs. 88-102 - Daniela Bubboloni, Costanza Catalano
On Computing Optimal Temporal Branchings. 103-117 - Dipayan Chakraborty
Contracting Edges to Destroy a Pattern: A Complexity Study. 118-131 - Dibyayan Chakraborty
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. 132-146 - Lamar Chidiac
An Efficient Computation of the Rank Function of a Positroid. 147-161 - William S. Evans
Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. 162-175 - Zack Fitzsimmons, Edith Hemaspaandra:
Complexity of Conformant Election Manipulation. 176-189 - Pamela Fleischmann, Jonas Höfer, Annika Huch, Dirk Nowotka:
α-β-Factorization and the Binary Case of Simon's Congruence. 190-204 - Fabian Frei, David Wehner:
Bounds for c-Ideal Hashing. 205-220 - Ajinkya Gaikwad, Soumen Maity:
Parameterized Complexity of the Th+1-Free Edge Deletion Problem. 221-233 - Joshua A. Grochow, Michael Levet:
On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman. 234-247 - Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski:
The Complexity of (Pk, Pℓ )-Arrowing. 248-261 - Yuya Higashikawa, Naoki Katoh, Guohui Lin
On Computing a Center Persistence Diagram. 262-275 - Philip Kaelbling
Robust Identification in the Limit from Incomplete Positive Data. 276-290 - Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams:
Cordial Forests. 291-303 - Jeff Kinne, Akbar Rafiey, Arash Rafiey, Mohammad Sorkhpar:
Vertex Ordering with Precedence Constraints. 304-317 - Chris Köcher
Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems. 318-332 - Jan Matyás Kristan
Shortest Dominating Set Reconfiguration Under Token Sliding. 333-347 - Van Bang Le
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. 348-362 - Sewon Park
Verified Exact Real Computation with Nondeterministic Functions and Limits. 363-377 - Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza:
Exact and Parameterized Algorithms for the Independent Cutset Problem. 378-391 - Emmanuel Sam, Benjamin Bergougnoux
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. 392-405 - Kodai Tanaka
Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku. 406-420 - Tomoyuki Yamakami:
Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata. 421-435
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-08 01:36 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: