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
1997On the Influence of the State Encoding on OBDD-Representations of Finite State Machines.Christoph Meinel, Thorsten Theobald
1997Counting Problems over the Reals.Klaus Meer
1997Two-Level Contextual Grammars: The Internal Case.Carlos Martn-Vide, Joan Miquel-Verges, Gheorghe Paun
1997Invertible Linear Cellular Automata over zGiovanni Manzini, Luciano Margara
1997Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds.Maciej Liskiewicz, Rdiger Reischuk
1997Optimal Algorithms for Complete Linkage Clustering in d Dimensions.Drago Krznaric, Christos Levcopoulos
1997Lower Bounds for a Proof System with an Expentential Speed-up over Constant-Depth Frege Systems and over Polynomial Calculus.Jan Krajcek
1997Real-Time Generation of Primes by a One-Dimensional Cellular Automaton with 11 States.Ivan Korec
1997Minimal Letter Frequency in n-th Power-Free Binary Words.Roman M. Kolpakov, Gregory Kucherov
1997Repetitiveness of D0L-Languages Is Decidable in Polynomial Time.Yuji Kobayashi, Friedrich Otto
1997Relating Conflict-Free Stable Transition and Event Models (Extended Abstract).Zurab Khasidashvili, John R. W. Glauert
1997A Characterization of Abstract Families of Algebraic Power Series.Georg Karner, Werner Kuich
1997On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs.Stasys Jukna, Alexander A. Razborov, Petr Savick, Ingo Wegener
1997Complexity of Finding Short Resolution Proofs.Kazuo Iwama
1997Communication Complexity and Sequential Compuation.Juraj Hromkovic, Georg Schnitger
1997Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations.Markus Holzer
1997A Topological Generalization of Propositional Linear Time Temporal Logic.Bernhard Heinemann
1997Integrating the Specification Techniques of Graph Transformation and Temporal Logic.Reiko Heckel, Hartmut Ehrig, Uwe Wolter, Andrea Corradini
1997The Giant Component Threshold for Random Regular Graphs with Edge Faults.Andreas Goerdt
1997On the Dilation of Interval Routing.Cyril Gavoille
1997Simulation as a Correct Transformation of Rewrite Systems.Wan J. Fokkink, Jaco van de Pol
1997A Tile-Based Coordination View of Asynchronous pi-Calculus.Gian-Luigi Ferrari, Ugo Montanari
1997Regulations by Valences.Henning Fernau, Ralf Stiebe
1997Positive Applications of Lattices to Cryptography.Cynthia Dwork
1997On the Generation of Trees by Hyperedge Replacement.Frank Drewes
2,2012,225 of 3,347← PreviousNext →

Comparable venues

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