- On Average-Case Hardness in TFNP from One-Way Functions2020 | Faculty of Mathematics and Physics
- On Search Complexity of Discrete Logarithm2021 | Faculty of Mathematics and Physics
- HARDNESS OF CONTINUOUS LOCAL SEARCH: QUERY COMPLEXITY AND CRYPTOGRAPHIC LOWER BOUNDS2020 | Faculty of Mathematics and Physics
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir2019 | Faculty of Mathematics and Physics
- PPP-Completeness and Extremal Combinatorics2023 | Faculty of Mathematics and Physics
