About me

I am an Assistant Professor in the Department of Computer Science, LTH at Lund University and have recently been appointed as a Wallenberg Academy Fellow (WAF). My research is in complexity theory, in particular proof, circuit and communication complexity. I am fortunate to, apart from WAF, count on funding from ELLITT, VR and WASP and to be working with an amazing team.

Prior to this, I was a postdoc at the Institute of Mathematics of the Czech Academy of Sciences, Prague, Czech Republic, hosted by Pavel Pudlák with a grant from the Knut and Alice Wallenberg Foundation. I was a research fellow at the Simons Institute for the Theory of Computing, University of California, Berkeley on two occasions: for the Satisfiability: Theory, Practice and Beyond Program in 2021 and for the Lower Bounds in Computational Complexity Program in 2018.

I received my PhD degree from KTH Royal Institute of Technology in Stockholm, Sweden, where I worked under the supervision of Jakob Nordström. I was awarded the Stockholm Mathematics Centre Prize for Excellent Doctoral Dissertation 2018/2019. During my Master's studies, I worked on graph theory under the supervision of Yoshiko Wakabayashi at the Institute of Mathematics and Statistics at the University of São Paulo, Brazil.