Christian Ikenmeyer is interested in complexity lower bounds, especially for algebraic complexity measures that can be studied with geometric complexity theory. Some famous examples are the determinant versus permanent problem, the Waring rank problem, and the border rank of matrix multiplication, but many more questions can be phrased in this framework. He is interested in explicit complexity lower bounds, but also in algorithmic aspects and computational hardness of the representation theoretic multiplicities that arise in these settings. He received his PhD in 2012 from Paderborn University, Germany, under the supervision of Peter Bürgisser. He was a visiting assistant professor at Texas A&M University for three years, and he is now a Senior Researcher at the Max Planck Institute for Informatics in Saarbrücken, Germany.