Specific topics of interest: Theory of error-correcting codes,
Approximation algorithms and hardness of approximation results for optimization problems, Theory of pseudorandomness, Probabilistically Checkable Proofs,
Complexity Theory, Algebraic algorithms.
Approximate
solutions to NP-hard problems (in the last couple of years, much
progress has been made by the theory community on some of the
"favorite" problems mentioned at the end of the
description)