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
2016Undecidability of Two-dimensional Robot Games.Reino Niskanen, Igor Potapov, Julien Reichert
2016Fully Dynamic Data Structure for LCE Queries in Compressed Space.Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016Shattered Sets and the Hilbert Function.Shay Moran, Cyrus Rashtchian
2016Shortest Unique Substring Queries on Run-Length Encoded Strings.Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016Stably Computing Order Statistics with Arithmetic Population Protocols.George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2016Piecewise Testable Languages and Nondeterministic Automata.Toms Masopust
2016Two-Variable Logic over Countable Linear Orderings.Amaldev Manuel, A. V. Sreejith
2016Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers.Christof Lding, Sarah Winter
2016Transformation Between Regular Expressions and omega-Automata.Christof Lding, Andreas Tollktter
2016Logical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions.Matias David Lee, Erik P. de Vink
2016A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT.Victor Lagerkvist, Biman Roy
2016On the Exact Learnability of Graph Parameters: The Case of Partition Functions.Nadia Labai, Johann A. Makowsky
2016Eulerian Paths with Regular Constraints.Orna Kupferman, Gal Vardi
2016On the Complexity of Universality for Partially Ordered NFAs.Markus Krtzsch, Toms Masopust, Michal Thomazo
2016The Generalised Colouring Numbers on Classes of Bounded Expansion.Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
2016Decidability of Predicate Logics with Team Semantics.Juha Kontinen, Antti Kuusisto, Jonni Virtema
2016Advice Complexity of the Online Induced Subgraph Problem.Dennis Komm, Rastislav Krlovic, Richard Krlovic, Christian Kudahl
2016Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs.Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
2016Dividing by Zero - How Bad Is It, Really?.Takayuki Kihara, Arno Pauly
2016Multi-Party Protocols, Information Complexity and Privacy.Iordanis Kerenidis, Adi Rosn, Florent Urrutia
2016Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs.Frank Kammer, Dieter Kratsch, Moritz Laudahn
2016Trading Determinism for Time in Space Bounded Computations.Vivek Anand T. Kallampally, Raghunath Tewari
2016On the Voting Time of the Deterministic Majority Process.Dominik Kaaser, Frederik Mallmann-Trenn, Emanuele Natale
2016Quantum Communication Complexity of Distributed Set Joins.Stacey Jeffery, Franois Le Gall
2016Minimal Phylogenetic Supertrees and Local Consensus Trees.Jesper Jansson, Wing-Kin Sung
901925 of 3,347← PreviousNext →

Comparable venues

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