FCT

Keyphrases

Publications

2023

William S. Evans, David G. Kirkpatrick
Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. FCT (2023)
Johanna Björklund
The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited. FCT (2023)
Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
On Computing a Center Persistence Diagram. FCT (2023)
Antonio Al Serhali, Joachim Niehren
Subhedge Projection for Stepwise Hedge Automata. FCT (2023)
Zack Fitzsimmons, Edith Hemaspaandra
Complexity of Conformant Election Manipulation. FCT (2023)
Kodai Tanaka, Takaaki Mizuki
Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku. FCT (2023)
Philip Kaelbling, Dakotah Lambert, Jeffrey Heinz
Robust Identification in the Limit from Incomplete Positive Data. FCT (2023)
Dipayan Chakraborty, R. B. Sandeep
Contracting Edges to Destroy a Pattern: A Complexity Study. FCT (2023)
Lamar Chidiac, Santiago Guzmán-Pro, Winfried Hochstättler, Anthony Youssef
An Efficient Computation of the Rank Function of a Positroid. FCT (2023)
Joshua A. Grochow, Michael Levet
On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman. FCT (2023)
Nathalie Aubrun, Nicolas Bitar
Domino Snake Problems on Groups. FCT (2023)
Martin Berglund, Henrik Björklund, Johanna Björklund
Parsing Unranked Tree Languages, Folded Once. FCT (2023)
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
Computing Subset Vertex Covers in H-Free Graphs. FCT (2023)
Pamela Fleischmann, Jonas Höfer, Annika Huch, Dirk Nowotka
α-β-Factorization and the Binary Case of Simon's Congruence. FCT (2023)
Van Bang Le, Christian Rosenke
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. FCT (2023)
Jan Matyás Kristan, Jakub Svoboda
Shortest Dominating Set Reconfiguration Under Token Sliding. FCT (2023)
Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. FCT (2023)
Jeff Kinne, Akbar Rafiey, Arash Rafiey, Mohammad Sorkhpar
Vertex Ordering with Precedence Constraints. FCT (2023)
Tomoyuki Yamakami
Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata. FCT (2023)
Chris Köcher, Dietrich Kuske
Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems. FCT (2023)
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
Exact and Parameterized Algorithms for the Independent Cutset Problem. FCT (2023)
Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. FCT (2023)
Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams
Cordial Forests. FCT (2023)
Ajinkya Gaikwad, Soumen Maity
-Free Edge Deletion Problem. FCT (2023)
Samy Abbes
Convergence of Distributions on Paths. FCT (2023)
Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva
On Computing Optimal Temporal Branchings. FCT (2023)
Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski
)-Arrowing. FCT (2023)
Fabian Frei, David Wehner
Bounds for c-Ideal Hashing. FCT (2023)
Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara
The Rectilinear Convex Hull of Line Segments. FCT (2023)
Sewon Park
Verified Exact Real Computation with Nondeterministic Functions and Limits. FCT (2023)

volume 14292, 2023

Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings FCT 14292 (2023)

2021

volume 12867, 2021

Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings FCT 12867 (2021)