Research interests: Complexity theory, with emphasis on proving lower bounds for computational models: Boolean and arithmetic circuit complexity, communication complexity, interactive proofs and probabilistically checkable proofs, randomness and derandomization, time-space lower bounds for learning.