Talks

Slides of selected workshop and conference talks.

project thumbnail

Optimal Lower Bounds for Symmetric Modular Circuits

ICALP 2026, Royal Holloway, University of London

project thumbnail

Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials

Proof Complexity Workshop 2026, University of Bath

project thumbnail

Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials

BCTCS 2026, Birmingham

project thumbnail

Arity Hierarchies for Quantifiers closed under Partial Polymorphisms

CSL 2026, Paris

project thumbnail

Symmetric Algebraic Circuits and Homomorphism Polynomials (video)

ITCS 2026, Milan

project thumbnail

Symmetric Proofs in the Ideal Proof System

Oxford Proof Complexity Workshop 2025

project thumbnail

Limitations of Affine CSP Algorithms

ICALP 2025, Aarhus

project thumbnail

Symmetric Algebraic Circuits and Homomorphism Polynomials

FMT Workshop 2025, Les Houches

project thumbnail

Limitations of Affine CSP Algorithms (long version)

CSP World Congress 2024, Colfosco

project thumbnail

Limitations of Game Comonads for Invertible-Map Equivalence

CSL 2024, Naples

project thumbnail

On logic in complexity theory, and birds and frogs

Logic Mentoring Workshop @ CSL 2023, Warsaw
project thumbnail

Lower bounds for Choiceless Polynomial Time via XOR-circuits

Highlights of Logic, Games and Automata 2023, Kassel

project thumbnail

A Finite-Model-Theoretic View on Propositional Proof Complexity

Simons Online Workshop 2021 on Theoretical Foundations of SAT/SMT Solving