Hi! I am a fourth-year PhD student in theoretical computer science at Lund University. My advisor is Tatyana Turova. My research concerns computational complexity theory and proof complexity in particular. I am especially interested in understanding the complexity of (random) constraint satisfaction problems.

Education

• M.Sc. in Mathematics, joint degree between Stockholm University and KTH Royal Institute of Technology, Stockholm, Sweden.
• B.Sc. in Engineering Physics, KTH Royal Institute of Technology, Stockholm, Sweden.

You can find my CV here.

Publications

• Lower Bounds for CSP Hierarchies Through Ideal Reduction
  Joint work with Yassine Ghananne and Shuo Pang
  To appear in SODA 2026
  [slides from talk at Oxford Proof Complexity workshop 2025]
• Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
  Joint work with Susanna de Rezende, Jakob Nordström, Shuo Pang, and Kilian Risse
  FOCS 2023
  [arXiv] [ECCC]
  [my presentation at Oberwolfach Workshop 2413] [slides]
  [Shuo’s presentation at Simons Institute]
• Geometric Bounds for Steklov Eigenvalues on Graphs
  Master’s thesis, Stockholm University. Received a Mittag-Leffler Prize from the Stockholm University Department of Mathematics.
  [full text]