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
1989Pushdown Automata on Infinite Trees and Omega-Kleene closure of Context-Free Tree Sets.Ahmed Saoudi
1989Knuth-Morris-Pratt Algorithm: An Analysis.Mireille Rgnier
1989Characterization of Recognizable Trace Languages by Distributed Automata (Extended Abstract).Antoine Petit
1989An Extended Herbrand Theorem for First-Order Theories with Equality Interpreted in Partial Algebras.Uwe Petermann
1989Logically Defined Subsets of NPierre Pladeau
1989Area Complexity of Merging.Vladimir Palko, Ondrej Skora, Imrich Vrto
1989Correctness of Concurrent Processes.Ernst-Rdiger Olderog
1989Generalizing Singly-Linked List Reorganizing Heuristics for Doubly-Linked Lists.David T. H. Ng, B. John Oommen
1989Pomset Semantics for True Concurrency with Synchronization and Recursion (Extended Abstract).John-Jules Ch. Meyer, Erik P. de Vink
1989Switching Graphs and Their Complexity.Christoph Meinel
1989LEDA: A Library of Efficient Data Types and Algorithms.Kurt Mehlhorn, Stefan Nher
1989Concurrency, Modularity, and Synchronization.Antoni W. Mazurkiewicz
1989On the Nature of TELLUS (a Typed Equational Logic Look over Uniform Specification).Vincenzo Manca, Antonino Salibra, Giuseppe Scollo
1989Complexity of Decision Problems Under Incomplete Information.Wojciech Kowalczyk
1989An Iterative Metric Fully Abstract Semantics for Nondeterministic Dataflow (Extended Abstract).Joost N. Kok
1989Integer Relations Among Algebraic Numbers.Bettina Just
1989Memory and Algebra.C. Jousselin, J.-P. Moskowitz
1989Testing Approximate Symmetry in the Plane is NP-hard.Sebastian Iwanowski
1989Pinwheel Scheduling With Tow Distinct Numbers.Robert Holte, Louis E. Rosier, Igor Tulchinsky, Donald A. Varvel
1989Generalized Definite Tree Languages.Uschi Heuter
1989Polynomial-Time Functions Generate SAT: On P-Splinters.Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes
1989Space Bounded Computations: Review And New Separation Results.Juris Hartmanis, Desh Ranjan
1989A Thesis for Bounded Concurrency.David Harel
1989System Simulation and the Sensitivity of Self-Stabilization.Mohamed G. Gouda, Rodney R. Howell, Louis E. Rosier
1989Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract).Rob J. van Glabbeek, Ursula Goltz
2,6262,650 of 3,347← PreviousNext →

Comparable venues

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