Computational complexity theory and its connections to algorithms,
combinatorics and mathematical logic.
On the power (and weakness) of negation gates(with T. Malkin, I. Orlov and A.
Majority is incompressible by ACC[p]
circuits (with R. Santhanam)
evolution of Erdos-Ko-Rado in random hypergraphs (with M. Gauy
Learning circuits with few negations (with
E. Blais, C. Canonne, R. Servedio and L.-Y.