Contact

Research

Complexity theorists study the power and the limits of computation. Can every cryptographic encryption scheme be broken? How much time is required to solve the problems that we care about? Is randomness necessary for efficient computation? As of today, no one knows the answers to these fundamental questions.

Teaching

Talks

Other

This year, I am co-organizing the first Tree Width Challenge, which is part of PACE 2016 (The First Parameterized Algorithms and Computational Experiments Challenge).

Publications

Curriculum Vitae

  • Berkeley (2015–2016)
  • Saarbrücken (2014–)
  • Paris (2013–2014)
  • Madison (2011–2013)
  • Berlin (2007–2011)
  • Saarbrücken (–2007)
More details »