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
1984On the Complexity of Inductive Inference (Preliminary Report).Robert P. Daley, Carl H. Smith
1984Weak and Strong Fairness in CCS.Gerardo Costa, Colin Stirling
1984Nondeterminism Is Essential for Two-Way Counter Machines.Marek Chrobak
1984Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields.Alexander L. Chistov, Dima Grigoriev
1984On Generalized Words of Thue-Morse.Anton Cern
1984An Investigation of Controls for Concurrent Systems by Abstract Control Languages.Hans-Dieter Burkhard
1984On the Herbrand Kleene Universe for Nondeterministic Computations.Manfred Broy
1984A Truely Morphic Characterization of Recursively Enumerable Sets.Franz-Josef Brandenburg
1984Computability of Probabilistic Parameters for Some Classes of Formal Languages.Joffroy Beauquier, Los Thimonier
1984Sparse Oracles, Lowness, and Highness.Jos L. Balczar, Ronald V. Book, Uwe Schning
1984Separating, Strongly Separating, and Collapsing Relativized Complexity Classes.Jos L. Balczar
1984On the Ehrenfeucht Conjecture on Test Sets and Its Dual Version.Jrgen Albert
1981Preserving Total Order in Constant Expected Time.Juraj Wiedermann
1981Admissible Representations of Effective CPO's.Klaus Weihrauch, Gisela Schfer
1981A Starvation-Free Solution of the Dining Philosopher's Problem by Use of Interaction Systems.Horst F. Wedde
1981Generalizations of Petri Nets.Rdiger Valk
1981Fast Parallel Computation of Polynomials Using Few Processes.Leslie G. Valiant, Sven Skyum
1981Testing of Join Dependency Preserving by a Modified Chase Method.Katsumi Tanaka, Yahiko Kambayashi
1981Axiomatic Semantics of Indirect Addressing.Juraj Steiner
1981Complexity and Entropy.Ludwig Staiger
1981Axioms for the Term-Wise Correctness of Programs.Stefan Sokolowski
1981On Structural Similarity of Context-Free Grammars.Eljas Soisalon-Soininen, Derick Wood
1981On Existence of Complete Predicate Calculus in Metamathematics without Exponentiation.Vladimir Yu. Sazonov
1981A Framework for Studying Grammars.Branislav Rovan
1981On Representations of Dynamic Algebras with Reversion.Jan Reiterman, Vera Trnkov
2,8262,850 of 3,347← PreviousNext →

Comparable venues

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