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
1988Local Checking of Trace Synchroniziability.Volker Diekert, Walter Vogler
1988Termination of Rewriting is Undecidable in the One-Rule Case.Max Dauchet
1988The Steiner Tree Problem and Homogeneous Sets.Alessandro D'Atri, Marina Moscarini, Antonio Sassano
1988Multiple Propositional Dynamic Logic of Parallel Programs (Extended Abstract).Ryszard Danecki
1988String Matching with Constraints.Maxime Crochemore
1988Testing Isomorphism of Outerplanar Graphs in Parallel.Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik
1988Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models.Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik
1988On Models and Algebras for Concurrent Processes.Ludmila Cherkasova
1988On Positive Occur-Checks in Unification.Philippe le Chenadec
1988Infinite Behaviour if Deterministic Petri Nets.Heino Carstensen
1988On Maximal Prefix Sets of Words.Vronique Bruyre
1988Automata and Rational Expressions on Planar Graphs.Francis Bossut, Max Dauchet, Bruno Warin
1988Sparse Sets, Tally Sets, and Polynomial Reducibilities.Ronald V. Book
1988Functional Programming and Combinatory Algebras.Corrado Bhm
1988Distribution of Sequential Processes.Joffroy Beauquier, Antoine Petit
1988Implementing Abstract Data Structures in Hardware.Frank Bauernppel, Hermann Jung
1988Breadth-First Phrase Structure Grammars and Queue Automata.E. Allevi, Alessandra Cherubini, Stefano Crespi-Reghizzi
1988Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability.Farid M. Ablayev
1986On the Degree of Ambiguity of Finite Automata.Andreas Weber, Helmut Seidl
1986The OI-Hierarchy is Closed under Control.Heiko Vogler
1986Higher-Order Arrays and Stacks in Programming. An Application of Complexity Theory to Logics of Programs.Jerzy Tiuryn
1986A Greedy Algorithm for Constructing Shortest Common Superstrings.Jorma Tarhio, Esko Ukkonen
1986The Centers of Context-Sensitive Languages.Ludwig Staiger, Werner Nehrlich
1986The Parallel Complexity of Deadlock Detection.Paul G. Spirakis
1986Complexity of Generalized Graph Coloring.Vladislav Rutenburg
2,7012,725 of 3,347← PreviousNext →

Comparable venues

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