Contact

Research

Algorithms & Complexity is about the power and the limits of computation. Can every cryptographic encryption scheme be broken? For which problems can we beat the exhaustive search method? Is randomness necessary for efficient computation? As of today, no one knows the answers to these fundamental questions.

Teaching

Talks

Publications

Service

Curriculum Vitae

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