Jump to content

Chris Umans

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Hooperbloob (talk | contribs) at 14:16, 11 September 2014 (+notability tag). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Chris Umans
NationalityUnited States American
Alma materWilliams College, University of California, Berkeley
Known forComputational complexity, Algorithms, Hardness of approximation, Matrix Multiplication
Scientific career
FieldsComputer Science
InstitutionsCalifornia Institute of Technology
Doctoral advisorChristos 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]

Awards and honors

Umans received an NSF CAREER award in 2004 and an Alfred P. Sloan Fellowship in 2005.[2] 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

  1. ^ A group-theoretic approach to fast matrix multiplication, doi:10.1109/SFCS.2003.1238217
  2. ^ Sloan Fellows

Template:Persondata