Skip to content

International Symposium on Fundamentals of Computation Theory

FCT

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation

Papers indexed

1,086

1977–2025

Papers per year

1977110 peak2025

FCT papers

1,086 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2007On Block-Wise Symmetric Signatures for Matchgates.Jin-yi Cai, Pinyan Lu
2007On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation.Nadia Busi, Claudio Zandron
2007A String-Based Model for Simple Gene Assembly.Robert Brijder, Miika Langille, Ion Petre
2007From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates.Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
2007Pattern Matching in Protein-Protein Interaction Graphs.Galle Brevier, Romeo Rizzi, Stphane Vialette
2007The Complexity of Membership Problems for Circuits over Sets of Positive Numbers.Hans-Georg Breunig
2007Rewriting Systems with Data.Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu
2007Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems.Henning Bordihn, Gyrgy Vaszil
2007FJMIP: A Calculus for a Modular Object Initialization.Viviana Bono, Jaroslaw D. M. Kusmierek
2007On Notions of Regularity for Data Languages.Henrik Bjrklund, Thomas Schwentick
2007Local Testing of Message Sequence Charts Is Difficult.Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
2007A Novel Information Transmission Problem and Its Optimal Solution.Eric Bach, Jin-yi Cai
2007Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis
2007A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings.Abdullah N. Arslan
2005Collapsing Recursive Oracles for Relativized Polynomial Hierarchies.Tomoyuki Yamakami
2005Completeness and Compactness of Quantitative Domains.Pawel Waszkiewicz
2005Logspace Optimization Problems and Their Approximability Properties.Till Tantau
2005The Smoothed Analysis of Algorithms.Daniel A. Spielman
2005On the Power of Unambiguity in Alternating Machines.Holger Spakowski, Rahul Tripathi
2005Perfect Reconstruction of Black Pixels Revisited.Hans Ulrich Simon
2005A Self-dependency Constraint in the Simply Typed Lambda Calculus.Aleksy Schubert
2005Average-Case Non-approximability of Optimisation Problems.Birgit Schelm
2005Adaptive Zooming in Point Set Labeling.Sheung-Hung Poon, Chan-Su Shin
2005Relations Between Average-Case and Worst-Case Complexity.Aduri Pavan, N. V. Vinodchandran
2005Constant Time Generation of Linear Extensions.Akimitsu Ono, Shin-Ichi Nakano
301325 of 1,086← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.