I also maintain a Google Scholar page.

  1. One-Way Functions vs. TFNP: Simpler and Improved
    with Lukáš Folwarczný, Mika Göös, Pavel Hubáček and Weiqiang Yuan
    Conference version: Innovations in Theoretical Computer Science Conference (ITCS) 2024

  2. Randomised Composition and Small-Bias Minimax
    with Shalev Ben-David, Eric Blais and Mika Göös
    Conference version: Foundations of Computer Science (FOCS) 2022

  3. Separations in Proof Complexity and TFNP
    with Mika Göös, Alexandros Hollender, Siddhartha Jain, William Pires, Robert Robere and Ran Tao
    Conference version: Foundations of Computer Science (FOCS) 2022

  4. Further Collapses in TFNP
    with Mika Göös, Alexandros Hollender, Siddhartha Jain, William Pires, Robert Robere and Ran Tao
    Conference version: Computational Complexity Conference (CCC) 2022
    Video: Mika presenting at MIAO, November 2021
    Video: Me presenting at CCC, July 2022

  5. A Majority Lemma for Randomised Query Complexity
    with Mika Göös
    Conference version: Computational Complexity Conference (CCC) 2021
    Video: Me presenting at CCC, July 2021

  6. Communication Efficient Coresets for Maximum Matching
    with Michael Kapralov and Jakab Tardos
    Conference version: Symposium on Simplicity in Algorithms (SOSA) 2021

Theses

  1. Coresets for graph matching
    master thesis 2020

  2. Non-repetitive colorings of graphs
    semester project 2017