Computational complexity theory and its connections to algorithms,
combinatorics and mathematical logic.
evolution of Erdos-Ko-Rado in random hypergraphs.
(with M. Gauy, H. Han and Y. Kohayakawa)
Learning circuits with few negations.
(with E. Blais, C. Cannone, R. Servedio and L. Tan)
versus circuit lower bounds. [ECCC TR13-117]
formulation of the graph reconstruction conjecture.
(with B. Thatte)
hard functions from
(with A. Klivans and P. Kothari)
simple algorithmic explanation for the concentration of measure
A few other papers, technical reports, and lecture notes can be