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
1978The Connection between Modal Logic and Algorithmic Logic.Peter van Emde Boas
1978Decision Problems Concerning Parallel Programming.Jan A. Bergstra
1978Mastering Contextsensitivity in Programming Languages.Gerhard Barth
1978On the Completeness of Query Languages for Relational Data Bases.Franois Bancilhon
1978Writing and Verifying Sequential Files Updating Programs.Mikhail Auguston
1977A Uniform Approach to Inductive Posets and Inductive Closure.Jesse B. Wright, Eric G. Wagner, James W. Thatcher
1977Identification of Formal Languages.Rolf Wiehagen
1977A Generalized Computability Thesis (Abstract).Klaus Weihrauch
1977The Influence of the Machine Model on the Time Complexity of Context-Free Language Recognition.Reinhold Weicker
1977Determining Processes by Violations.Horst F. Wedde, Jzef Winkowski
1977Properties of Complexity Classes: A Short Survey.Gerd Wechsung
1977Complexity Hierarchies of Oracles.Klaus W. Wagner, Gerd Wechsung
1977The Bodnarchuk Metric Space of Languages and the Topology of the Learning Space.Victor Vianu
1977Real Time Computations with Restrictions on Tape Alphabet.Mars K. Valiev
1977Graph-Theoretic Arguments in Low-Level Complexity.Leslie G. Valiant
1977On Languages, Accepted by Machines in the Category of Sets.Vera Trnkov, Jir Admek
1977Frequency Algorithms and Computations.Boris A. Trakhtenbrot
1977Fixed-Points and Algebras with Infinitely Long Expressions, I.Jerzy Tiuryn
1977A Fast Non-Commutative Algorithm for Matrix Multiplication.Ondrej Skora
1977Time and Tape Bounded Auxiliary Pushdown Automata.Ivan Hal Sudborough
1977A Model for Retrieval Systems and Some Mathematical Problems Behind.Jn Sturc
1977Total Correctness for Procedures.Stefan Sokolowski
1977Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials.Claus-Peter Schnorr
1977Applied Algorithmic Logic.Andrzej Salwicki
1977How Good Is the Adversary Lower Bound?Peter Ruzicka, Juraj Wiedermann
3,0513,075 of 3,347← PreviousNext →

Comparable venues

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