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
2006An Expressive Temporal Logic for Real Time.Yoram Hirshfeld, Alexander Moshe Rabinovich
2006Approximation Algorithms and Hardness Results for Labeled Connectivity Problems.Refael Hassin, Jrme Monnot, Danny Segev
2006Dimension Characterizations of Complexity Classes.Xiaoyang Gu, Jack H. Lutz
2006NOF-Multiparty Information Complexity Bounds for Pointer Jumping.Andr Gronemeier
2006The Structure of Tractable Constraint Satisfaction Problems.Martin Grohe
2006Completeness of Global Evaluation Logic.Sergey Goncharov, Lutz Schrder, Till Mossakowski
2006Machines that Can Output Empty Words.Christian Glaer, Stephen D. Travers
2006Online Single Machine Batch Scheduling.Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer
2006From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions.Herman Geuvers, Iris Loeb
2006Magic Numbers in the State Hierarchy of Finite Automata.Viliam Geffert
2006Distributed Data Structures: A Survey on Informative Labeling Schemes.Cyril Gavoille
2006Optimally Fast Data Gathering in Sensor Networks.Luisa Gargano, Adele A. Rescigno
2006On the Correlation Between Parity and Modular Polynomials.Anna Gl, Vladimir Trifonov
2006Quantum Weakly Nondeterministic Communication Complexity.Franois Le Gall
2006Tree Exploration with an Oracle.Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2006Very Sparse Leaf Languages.Lance Fortnow, Mitsunori Ogihara
2006Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves.Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli
2006Toward the Eigenvalue Power Law.Robert Elssser
2006Smart Robot Teams Exploring Sparse Trees.Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Christian Schindelhauer
2006Lower Bounds for the Transition Complexity of NFAs.Michael Domaratzki, Kai Salomaa
2006Learning Bayesian Networks Does Not Have to Be NP-Hard.Norbert Dojer
2006Partially Commutative Inverse Monoids.Volker Diekert, Markus Lohrey, Alexander Miller
2006A Core Calculus for Scala Type Checking.Vincent Cremet, Franois Garillot, Sergue Lenglet, Martin Odersky
2006The Lempel-Ziv Complexity of Fixed Points of Morphisms.Sorin Constantinescu, Lucian Ilie
2006Optimal Linear Arrangement of Interval Graphs.Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov
1,6261,650 of 3,347← PreviousNext →

Comparable venues

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