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
1990The Use of Graphs of Elliptical Influence in Visuel Hierarchical Clustering.Mirko Krivnek
1990Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time.Matthias Krause
1990Interactive Computations of Optimal Solutions.Jan Krajcek, Pavel Pudlk, Jir Sgall
1990On Kleene Algebras and Closed Semirings.Dexter Kozen
1990Vector Language: Simple Description of Hard Instances (Extended Abstract).Miroslaw Kowaluk, Klaus W. Wagner
1990Pumping Lemmas for Tree Languages Generated by Rewrite Systems.Emmanuel Kounalis
1990On the Complexity of Genuinely Polynomial Computation.Marek Karpinski, Friedhelm Meyer auf der Heide
1990Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines.Janis Kaneps, Rusins Freivalds
1990Syntactic Theories.Jean-Pierre Jouannaud
1990A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract).Bengt Jonsson
1990Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract).Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
1990The Membership Problem for Context-Free Chain Code Picture Languages.Friedhelm Hinz
1990Dynamic Hashing Strategies.Friedhelm Meyer auf der Heide
1990Specification & Verification of Higher Order Processes.Michael R. Hansen, Zhou Chaochen
1990Tree-Stack Automata.Wolfgang Golubski, Wolfram-Manfred Lippe
1990Quality Criteria for Partial Order Semantics of Place/Transition-Nets.Robert Gold, Walter Vogler
1990Unrestricted Resolution versus N-Resolution.Andreas Goerdt
1990On Possibilities of One-Way Synchronized and Alternating Automata.Dainis Geidmanis
1990Speed-Up Theorem Without Tape Compression.Viliam Geffert
1990A First-Order Logic for Partial Recursive Functions.Antonio Gavilanes-Franco
1990Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract).Ricard Gavald, Leen Torenvliet, Osamu Watanabe, Jos L. Balczar
1990On Checking Versus Evaluation of Multiple Queries.William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene
1990Comparisons Among Classes of Y-Tree Systolic Automata.Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi
1990Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs.Pratul Dublish, S. N. Maheshwari
1990Event Structures, Causal Trees, and Refinements.Philippe Darondeau, Pierpaolo Degano
2,5762,600 of 3,347← PreviousNext →

Comparable venues

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