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
2005Generic Density and Small Span Theorem.Philippe Moser
2005Approximation Results for the Weighted PJrme Monnot, Sophie Toulouse
2005Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals.Daniel Meister
2005An Explicit Solution to Post's Problem over the Reals.Klaus Meer, Martin Ziegler
2005A Type System for Computationally Secure Information Flow.Peeter Laud, Varmo Vene
2005On the Incompressibility of Monotone DNFs.Matthias P. Krieger
2005On Approximating Real-World Halting Problems.Sven Khler, Christian Schindelhauer, Martin Ziegler
2005Leftist Grammars and the Chomsky Hierarchy.Tomasz Jurdzinski, Krzysztof Lorys
2005Translational Lemmas for Alternating TMs and PRAMs.Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai
2005Fully Incremental LCS Computation.Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2005Shrinking Multi-pushdown Automata.Markus Holzer, Friedrich Otto
2005Biautomatic Semigroups.Michael Hoffmann, Richard M. Thomas
2005On Finding Acyclic Subhypergraphs.Kouichi Hirata, Megumi Kuwabara, Masateru Harao
2005A New Linearizing Restriction in the Pattern Matching Problem.Yo-Sub Han, Derick Wood
2005Improved Algorithms and Complexity Results for Power Domination in Graphs.Jiong Guo, Rolf Niedermeier, Daniel Raible
2005The Complexity of Querying External Memory and Streaming Data.Martin Grohe, Christoph Koch, Nicole Schweikardt
2005Algorithms for Graphs Embeddable with Few Crossings Per Edge.Alexander Grigoriev, Hans L. Bodlaender
2005Reconstructing Many Partitions Using Spectral Techniques.Joachim Giesen, Dieter Mitsche
2005Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems.Bernd Grtner, Leo Rst
2005On the Black-Box Complexity of Sperner's Lemma.Katalin Friedl, Gbor Ivanyos, Miklos Santha, Yves F. Verhoeven
2005Exact Algorithms for Graph Homomorphisms.Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
2005Bounds on the Power of Constant-Depth Quantum Circuits.Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang
2005Deterministic Automata on Unranked Trees.Julien Cristau, Christof Lding, Wolfgang Thomas
2005Almost Optimal Explicit Selectors.Bogdan S. Chlebus, Dariusz R. Kowalski
2005The Complexity of Semilinear Problems in Succinct Representation.Peter Brgisser, Felipe Cucker, Paulin Jacob de Naurois
326350 of 1,086← PreviousNext →

Comparable venues

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