I am researcher in theoretical computer science, currently visiting Memorial University of Newfounland. I work on Computational Complexity, and Proof Complexity in particular. My interests include other areas of complexity such as pebble games, query complexity, communication complexity, and circuit complexity, and the theory of SAT solving.
Previously I was a graduate student in the Theoretical Computer Science Group at the KTH Royal Institute of Technology in Stockholm, under the supervision of Jakob Nordström, a postdoc at the School of Technology and Computer Science at the Tata Institute of Fundamental Research in Mumbai, hosted by Arkadev Chattopadhyay, a postdoc at the Computer Science Department at the Technion in Haifa, hosted by Yuval Filmus. and a docent (~assistant/associate professor) at the Mathematics and Computer Science Department at Saint Petersburg State University.