Professor Umans is interested in theoretical computer science, and especially computational complexity. He enjoys problems with an algebraic flavor, and this often leads to research questions in derandomization and explicit combinatorial constructions, algebraic algorithms, coding theory, and hardness of approximation.