STACS 2013 » Invited Talks

Invited Talks

  • Kousha Etessami, University of Edinburgh:
    The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (tentative)
Kousha Etessami
  • Kurt Mehlhorn, MPI Saarbrücken and Saarland University:
    Physarum can compute shortest paths (tentative)
  • Stéphan Thomassé, Ecole Normale Supérieure de Lyon:
    Graph Coloring, Communication Complexity and the Stubborn Problem (tentative)
Stéphan Thomassé