Chris Umans
Chris Umans | |
|---|---|
| Nationality |  American |
| Alma mater | Williams College, University of California, Berkeley |
| Known for | Computational complexity, Algorithms, Hardness of approximation, Matrix Multiplication |
| Scientific career | |
| Fields | Computer Science |
| Institutions | California Institute of Technology |
| Doctoral advisor | Christos Papadimitriou |
Chris Umans is Professor of computer science in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for work on algorithms, computational complexity, algebraic complexity, and hardness of approximation.
Academic biography
Umans studied at Williams College, where he completed a BA degree in Mathematics and Computer Science in 1996. He then received a PhD in Computer Science from University of California, Berkeley in 2000. Following his PhD, he was a postdoctoral researcher at Microsoft Research until joining Caltech in 2002.
Research
Umans' research centers broadly around algorithms and complexity. He has made notable contributions to varied areas within this space including random number generation, expanders, and algorithms for matrix multiplication. A notable example is his work on developing a group theoretic approach for matrix multiplication.[1]
In 2008, Umans and his student Dave Buchfuhrer settled a 1979 conjecture on the complexity of unbounded Boolean formula minimization; the result won a best paper award at ICALP.[2]
Awards and honors
Umans received an NSF CAREER award in 2004 and an Alfred P. Sloan Fellowship in 2005.[3] Additionally, his work has received "Best Paper" awards at the International Conference on Automata, Languages, and Programming (ICALP) and the IEEE Conference on Computational Complexity (CCC).
References
- ^ A group-theoretic approach to fast matrix multiplication, doi:10.1109/SFCS.2003.1238217
- ^ D. Buchfuhrer and C. Umans. "The complexity of Boolean formula minimization." Journal of Computer and System Sciences (JCSS). p. 142-153. 2011. An earlier version appeared in Proceedings of Automata, Languages and Programming, 35th International Colloquium, (ICALP). p. 24-35. 2008. Won the Best Paper Award in Track A "Algorithms, Automata, Complexity and Games".
- ^ Sloan Fellows