I recently joined the Department of Computer Science, LTH at Lund University as an Assistant Professor. My research interests are in computational complexity, in particular proof complexity, circuit complexity and communication complexity. You can read more about me here.
Address: Institutionen för datavetenskap, Lunds universitet
Ole Römers väg 3, office 2125e, 221 00 Lund, Sweden
- Proofs, Circuits, and Communication with Mika Göös and Robert Robere in SIGACT News Complexity Theory Column, March 2022.
- Together with Toni Pitassi and Robert Robere, I co-organized a workshop on proof complexity at FOCS '21. Links to slides and videos of the talks can be found on the workshop's website Reflections on Propositional Proofs in Algorithms and Complexity.
- I currently have one funded position for PhD students in theoretical computer science. For more information see open positions and feel free to drop me an email.