Before that, I was a student at University of Campinas,
Computational complexity theory and its connections to algorithms,
combinatorics and mathematical logic.
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.