Research Interests

Circuit Complexity  e.g. Lower bounds for boolean circuits [RST]
Proof Complexity   e.g. Lower bounds for propositional proofs [PRST]
Property Testing  e.g. Lower bounds for testing function properties [CSTWX, CDST]
Pseudorandomness  e.g. PRGs and high-dimensional geometry [OST, OSTK]
Learning Theory  e.g. Algorithms for learning decision trees [BLQT]

A central theme in my work is the development of techniques to understand boolean function complexity,
and the application of these techniques to a range of areas in theoretical computer science.