41st International Symposium on

Mathematical Foundations of Computer Science

August 22-26, 2016, Krakow (Poland)



MFCS-16 is organized in coopperation with EATCS
 

  

Invited Speakers

There will be five invited talks from the following researchers:

  • Shai Ben-David, University of Waterloo, Canada
         How Far Are We From Having a Satisfactory Theory of Clustering?
         [slides]
  • Mikołaj Bojańczyk, University of Warsaw, Poland
         Decidable Extensions of MSO
         [slides]
  • Patricia Bouyer-Decitre, LSV, CNRS & ENS de Cachan, France
         Optimal Reachability in Weighted Timed Automata and Games
         [slides]
  • Tobias Friedrich, Hasso Plattner Institute, Potsdam, Germany
         Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms
  • Virginia Vassilevska Williams, Stanford University, USA
         RNA-Folding - From Hardness to Algorithms

Contact: Piotr Faliszewski