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
2001The Complexity of Tensor Circuit Evaluation.Martin Beaudry, Markus Holzer
2001Analysis Problems for Sequential Dynamical Systems and Communicating State Machines.Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
2001Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms.Albert Atserias
2001Exact Results for Accepting Probabilities of Quantum Automata.Andris Ambainis, Arnolds Kikusts
2001The Computational Power of a Family of Decision Forests.Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka
2001Refined Search Tree Technique for DOMINATING SET on Planar Graphs.Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
2000On the Use of Duality and Geometry in Layouts for ATM Networks.Shmuel Zaks
2000An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions.Hiroaki Yamamoto
2000Sublinear Ambiguity.Klaus Wich
2000Regularity of Congruential Graphs.Tanguy Urvoy
2000Abstract Syntax and Variable Binding for Linear Binders.Miki Tanaka
2000On Diving in Trees.Thomas Schwentick
2000A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism.Petr Savick, Detlef Sieling
2000Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems.Steffen Reith, Heribert Vollmer
2000Why so Many Temporal Logics Climb up the Trees?Alexander Moshe Rabinovich, Shahar Maoz
2000Binary Decision Diagrams by Shard Rewriting.Jaco van de Pol, Hans Zantema
2000Unary Pushdown Automata and Auxiliary Space Lower Bounds.Giovanni Pighizzini
2000Separation Results for Rebound Automata.Holger Petersen
2000Informative Labeling Schemes for Graphs.David Peleg
2000Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL.Leonor Prensa Nieto, Javier Esparza
2000Derivability in Locally Quantified Modal Logics via Translation in Set Theory.Angelo Montanari, Alberto Policriti, Matteo Slanina
2000pi-Calculus, Structured Coalgebras, and Minimal HD-Automata.Ugo Montanari, Marco Pistore
2000Bilinear Functions and Trees over the (max, +) Semiring.Sabrina Mantaci, Vincent D. Blondel, Jean Mairesse
2000Automatic Graphs and GraphOlivier Ly
2000On a Generalization of Bi-Complement Reducible Graphs.Vadim V. Lozin
1,9762,000 of 3,347← PreviousNext →

Comparable venues

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