Skip to content
cs-conference-ranking.org

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

Best Theory of Computation conferences

Papers per year

1977110 peak2025

Most published authors

FCT papers

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

YearTitleAuthors
1987Possibilities of Probabilistic on-line Counting Machines.Farid M. Ablayev
1985Degeneration of Shimura surfaces and a problem in coding theory.Th. Zink
1985The critical complexity of all (monotone) Boolean functions and monotone graph properties.Ingo Wegener
1985On the Boolean closure of NP.Gerd Wechsung
1985Iterated linear control and iterated one-turn pushdowns.Heiko Vogler
1985On several kinds of space-bounded on-line multicounter automata.Lutz Voelkel
1985Enumerative combinatorics and algebraic languages.Grard Viennot
1985On the length of single dynamic tests for monotone Boolean functions.Valery A. Vardanian
1985Continuous abstract data types: basic machinery and results.Andrzej Tarlecki, Martin Wirsing
1985A quadratic regularity test for non-deleting macro S grammars.Helmut Seidl
1985Tree-partite graphs and the complexity of algorithms.Detlef Seese
1985Generalized Thue-Morse sequences.Patrice Sbold
1985On colour critical graphs.Horst Sachs
1985Parallel time O(log n) recognition of unambiguous CFLs.Wojciech Rytter
1985About two-way transducers.Brigitte Rozoy
1985A multiparameter analysis of the boundedness problem for vector addition systems.Louis E. Rosier, Hsu-Chun Yen
1985Recent results on codes.Christophe Reutenauer
1985Probabilistic algorithms in group theory.John H. Reif
1985Quantifiers in combinatory PDL: completeness, definability, incompleteness.Solomon Passy, Tinko Tinchev
1985Are lower bounds on the complexity lower bounds for universal circuits.R. G. Nigmatullin
1985Recent results on continuous ordered algebras.Evelyn Nelson
1985The complexity of embedding graphs into binary trees.Burkhard Monien
1985Intersecting two polyhedra one of which is convex.Kurt Mehlhorn, Klaus Simon
1985Products of group languages.Stuart W. Margolis, Jean-Eric Pin
1985On the decidability of the theory of free groups (in Russian) = К Вопросу О Раэрещимости Теории Свободной Группы.G. S. Makanin
826–850 of 1,086← PreviousNext →

Comparable venues

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