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
2013On the Average Size of Glushkov and Equation Automata for KAT Expressions.Sabine Broda, Antnio Machiavelo, Nelma Moreira, Rogrio Reis
2013The Frequent Items Problem in Online Streaming under Various Performance Measures.Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2013Cancellation-Free Circuits in Unbounded and Bounded Depth.Joan Boyar, Magnus Gausdal Find
2013Efficient Sampling of Non-strict Turnstile Data Streams.Neta Barkay, Ely Porat, Bar Shalem
2013One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata.Kaspars Balodis
2013Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree.Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
2013On the Isomorphism Problem for Decision Trees and Decision Lists.Vikraman Arvind, Johannes Kbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev
2013Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy.Antonio Fernndez Anta, Chryssis Georgiou, Dariusz R. Kowalski, Elli Zavou
2013On the Complexity of Finding a Largest Common Subtree of Bounded Degree.Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu
2011On the Optimal Compression of Sets in PSPACE.Marius Zimand
2011Modifying the Upper Bound on the Length of Minimal Synchronizing Word.A. N. Trahtman
2011Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension.Ludwig Staiger
2011Hunting Distributed Malware with the κ-Calculus.Mila Dalla Preda, Cinzia Di Giusto
2011The Rewriting Logic Semantics Project: A Progress Report.Jos Meseguer, Grigore Rosu
2011Almost Transparent Short Proofs for NPℝ.Klaus Meer
2011Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes.Guillaume Malod
2011Kernelization: An Overview.Daniel Lokshtanov
2011Computational Randomness from Generalized Hardcore Sets.Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai
2011Enumeration of Minimal Dominating Sets and Variants.Mamadou Moustapha Kant, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
2011Data Reduction for Graph Coloring Problems.Bart M. P. Jansen, Stefan Kratsch
2011LIFO-Search on Digraphs: A Searching Game for Cycle-Rank.Paul Hunter
2011Parameterized Complexity of Vertex Deletion into Perfect Graph Classes.Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger
2011A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application.Gregory Z. Gutin, Mark Jones, Anders Yeo
2011Impugning Randomness, Convincingly.Yuri Gurevich
2011A Coinductive Calculus for Asynchronous Side-Effecting Processes.Sergey Goncharov, Lutz Schrder
201225 of 1,086← PreviousNext →

Comparable venues

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