[Home][Research][Teaching][Theory links][Other]
I am a professor of Computer Science in the Computing and Mathematical Sciences department at Caltech, and a member of the Theory Group. My research interests are in theoretical computer science, especially computational complexity. Specifically, I am interested in derandomization, explicit constructions, algebraic complexity and algorithms, and hardness of approximation. I received my Ph.D. in Computer Science from Berkeley in 2000. From 20002002 I was a postdoc in the Theory Group at Microsoft Research. I joined Caltech in 2002. 

Apply to Caltech:
Some professional activities:


On this page you can find:

Chris Umans Computer Science, MC 30516 California Institute of Technology 1200 E. California Blvd. Pasadena, CA 91125  Office: Annenberg 311 (626) 3955725 umans@cs.caltech.edu 