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
1981Lower Bounds for Problems Defined by Polynomial Inequalities.Jerzy W. Jaromczyk
1981Generating Graph Languages Using Hypergraph Grammars.Dirk Janssens, Grzegorz Rozenberg
1981A Definition of the P=NP-Problem in Categories.Hagen Huwig
1981One Pebble Does Not Suffice to Search Plane Labyrinths.Frank Hoffmann
1981Random Access Machines and Straight-Line Programs.Friedhelm Meyer auf der Heide, Hans-Anton Rollik
1981An Algorithm to Identify Slices, with Applications to Vector Replacement Systems.Jan Grabowski
1981Fast Recognition of Rings and Lattices.Pavel Goralcik, A. Goralcikov, Vclav Koubek, Vojtech Rdl
1981An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration.Zoltn sik
1981Specifying Algebraic Data Types by Domain Equations.Hans-Dieter Ehrich
1981Extremal Combinatorial Problems in Relational Data Base.Jnos Demetrovics, Gyula O. H. Katona
1981Equality Languages and Language Families.Jrgen Dassow
1981On the Error Correcting Power of Pluralism in Inductive Inference.Robert P. Daley
1981Homogenity and Completeness.B. Cskny
1981Quasi-Equational Logic for Partial Algebras.Peter Burmeister
1981Classes of Functions over Binary Trees.Hans Kleine Bning
1981Analogies of PAL and COPY.Franz-Josef Brandenburg
1981Logical Description of Computation Processes.Egon Brger
1981A New Operation Between Languages.Joffroy Beauquier
1981An Algebraic Defenition of Attributed Transformations.Mikls Bartha
1981Moderately Exponential Bound for Graph Isomorphism.Lszl Babai
1981Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems.Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
1981Some Universal Algebraic and Model Theoretic Results in Computer Science.Hajnal Andrka, Istvn Nmeti
1981Observability and Nerode Equivalence in Concrete C5ategories.Jir Admek
1979The oscillation complexity and a hierarchy of context-free languages.Gerd Wechsung
1979Invariants of grammartransformations.Hermann K.-G. Walter
951975 of 1,086← PreviousNext →

Comparable venues

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