Professor of Computer Science
Degrees and Appointments
B.A., Williams College, 1996; Ph.D., University of California, 2000. Assistant Professor, Caltech, 2002-08; Associate Professor, 2008-10; Professor, 2010-.
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.
List of Research Areas
computational complexity, randomness in computation, algebraic complexity and algorithms, hardness of approximation
Social and Information Sciences Laboratory, Center for the Mathematics of Information