Skip to content

International Symposium on Mathematical Foundations of Computer Science

MFCS

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation

Papers indexed

3,347

1973–2026

Papers per year

1973101 peak2026

MFCS papers

3,347 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
1989Proving Correctness of Constructor Implementations.Jordi Farrs-Casals
1989Logical Characterizations of Nonmonotonic TMSs.Charles Elkan
1989Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract).Krzysztof Diks, Torben Hagerup, Wojciech Rytter
1989On the Power of Synchronization in Parallel Computations.Jrgen Dassow, Juraj Hromkovic, Juhani Karhumki, Branislav Rovan, Anna Slobodov
1989Monadic Second-Order Logic and Context-Free Graph-Grammars.Bruno Courcelle
1989Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract).Bogdan S. Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha
1989Concurrent Nondeterministic Processes: Adequacy of Structure and Behaviour.Ludmila Cherkasova, Vadim E. Kotov
1989Ehrenfeucht Test Set Theorem and Hilbert Basis Theorem: A Constructive Glimpse.Cristian Calude, Dragos Vaida
1989Control Flow versus Logic: A Denotational and a Declarative Model for Guarded Horn Clauses.Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
1989Oracle Branching Programs and Logspace versus P.David A. Mix Barrington, Pierre McKenzie
1989Algebraic Closed Theories.ric Badouel
1989Proof-Theoretic Characterisations of Logic Programs.James H. Andrews
1989On the Strength of Temporal Proofs.Hajnal Andrka, Istvn Nmeti, Ildik Sain
1989From Specification Languages to Specification Knowledge Bases: The PTO Approach.Valery N. Agafonov
1989On Comparing Probabilistic and Deterministic Automata Complexity of Languages.Farid M. Ablayev
1988Reusable Specification Components.Martin Wirsing, Rolf Hennicker, Ruth Breu
1988A Decomposition Theorem for Finite-Valued Tranducers and an Application to the Equivalence Problem.Andreas Weber
1988Failures Semantics and Deadlocking of Modular Petri Nets.Walter Vogler
1988Bisections of Free Monoids and a New Unavoidable Regularity.Stefano Varricchio
1988Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability.Ewald Speckenmeyer
1988On the Power of Communication in Alternating Machines.Anna Slobodov
1988Recognizable Sets with Multiplicities in the Tropical Semiring.Imre Simon
1988Robust Orale Machines.Uwe Schning
1988Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability (Extended Abstract).Petr Savick
1988An Almost Linear Robinson Unification ALgorithm.Peter Ruzicka, Igor Prvara
2,6512,675 of 3,347← PreviousNext →

Comparable venues

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