- NP search problems in low fragments of bounded arithmetic2007 | Faculty of Mathematics and Physics
- Circuit lower bounds in bounded arithmetics2015 | Faculty of Mathematics and Physics
- LOGICAL STRENGTH OF COMPLEXITY THEORY AND A FORMALIZATION OF THE PCP THEOREM IN BOUNDED ARITHMETIC2015 | Faculty of Mathematics and Physics
- Models of Bounded Arithmetic and variants of the Pigeonhole Principle2023 | Faculty of Mathematics and Physics
- Expander Construction in VNC12017 | Faculty of Mathematics and Physics
- Expander construction in VNC12020 | Faculty of Mathematics and Physics
- Forcing with random variables and Proof Complexity2011 | Faculty of Mathematics and Physics
- H-colouring dichotomy in proof complexity2021 | Faculty of Mathematics and Physics
- A saturation property of structures obtained by forcing with a compact family of random variables2013 | Faculty of Mathematics and Physics
- Proof Systems that Take Advice2011 | Faculty of Mathematics and Physics
- Randomized feasible interpolation and monotone circuits with a local oracle2018 | Faculty of Mathematics and Physics