Chris Umans

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 under Christos Papadimitriou. Following his PhD, he was a postdoctoral researcher at Microsoft Research until joining Caltech in 2002.

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.

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.

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

{{Reflist|refs=

{{citation |doi=10.1109/SFCS.2003.1238217 |chapter=A group-theoretic approach to fast matrix multiplication|arxiv=math/0307321|title=44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings|pages=438–449|year=2003|last1=Cohn|first1=H.|last2=Umans|first2=C.|isbn=978-0-7695-2040-7|s2cid=5890100 }}

[http://www.sloan.org/sloan-research-fellowships/ Sloan Fellows]

{{cite journal |doi=10.1016/j.jcss.2010.06.011 |doi-access=free |title=The complexity of Boolean formula minimization |journal=Journal of Computer and System Sciences |volume=77 |issue=1 |pages=142–153 |date=January 2011 |author-last1=Buchfuhrer |author-first1=David |author-last2=Umans |author-first2=Christopher |author-link2=Christopher Umans}} This is an extended version of the conference paper: {{cite conference |doi=10.1007/978-3-540-70575-8_3 |chapter=The Complexity of Boolean Formula Minimization |book-title=Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7–11, 2008, Proceedings, Part I |editor=Luca Aceto |editor2=Ivan Damgård |display-editors=etal |pages=24–35 |publisher=Springer-Verlag |location=Berlin / Heidelberg, Germany |series=Lecture Notes in Computer Science |date=2008 |author-last1=Buchfuhrer |author-first1=David |author-last2=Umans |author-first2=Christopher |title=Automata, Languages and Programming |volume=5125 |author-link2=Christopher Umans |isbn=978-3-540-70574-1 |url=http://users.cms.caltech.edu/~umans/papers/BU07.pdf |access-date=2018-01-14 |url-status=live |archive-url=https://web.archive.org/web/20180114141842/http://users.cms.caltech.edu/~umans/papers/BU07.pdf |archive-date=2018-01-14}} This won the Best Paper Award in Track A "Algorithms, Automata, Complexity and Games".

{{cite conference|last1=Cohn|first1=Henry|last2=Kleinberg|first2=Robert|last3=Szegedy|first3=Balász|last4=Umans|first4=Christopher|title=Group-theoretic Algorithms for Matrix Multiplication|url=https://doi.org/10.1109/SFCS.2005.39|publisher=IEEE|book-title=Proc. 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS)|date=2005|pages=379–388|doi=10.1109/SFCS.2005.39|arxiv=math/0511460}}

{{cite conference|last1=Cohn|first1=Henry|last2=Umans|first2=Christopher|title=Fast matrix multiplication using coherent configurations|url=https://doi.org/10.1137/1.9781611973105.77|publisher=SIAM|book-title=Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)|date=2013|pages=1074–1087|doi=10.1137/1.9781611973105.77|arxiv=1207.6528}}

{{cite journal|last1=Blasiak|first1=Jonah|last2=Church|first2=Thomas|last3=Cohn|first3=Henry|last4=Grochow|first4=Joshua A.|last5=Naslund|first5=Eric|last6=Sawin|first6=William F.|last7=Umans|first7=Christopher|title=On cap sets and the group-theoretic approach to matrix multiplication|journal=Discrete Analysis|year=2017|url=https://doi.org/10.19086/da.1245|doi=10.19086/da.1245|arxiv=1605.06702}}

{{cite arXiv |last1=Blasiak|first1=Jonah|last2=Church|first2=Thomas|last3=Cohn|first3=Henry|last4=Grochow|first4=Joshua A.|last5=Umans|first5=Christopher|date=2017|title=Which groups are amenable to proving exponent two for matrix multiplication?|eprint=1712.02302 |class=math.GR}}

{{cite conference|last1=Blasiak|first1=Jonah|last2=Cohn|first2=Henry|last3=Grochow|first3=Joshua A.|last4=Pratt|first4=Kevin|last5=Umans|first5=Christopher|title=Matrix Multiplication via Matrix Groups|publisher=Schloss Dagstuhl - Leibniz-Zentrum für Informatik|book-title=14th Innovations in Theoretical Computer Science Conference (ITCS 2023)|date=2023|pages=19:1–19:16|doi=10.4230/LIPIcs.ITCS.2023.19|doi-access=free }}

{{cite journal|last1=Alon|first1=Noga|last2=Shpilka|first2=Amir|last3=Umans|first3=Christopher|title=On sunflowers and matrix multiplication|journal=Computational Complexity|year=2013|volume=22 |issue=2 |pages=219–243 |url=https://doi.org/10.1007/s00037-013-0060-1|doi=10.1007/s00037-013-0060-1}}

}}

• [http://users.cms.caltech.edu/~umans/ Chris Umans professional home page]

{{Authority control}}

{{DEFAULTSORT:Umans, Chris}}

Category:Living people

Category:California Institute of Technology faculty

Category:Theoretical computer scientists

Category:Year of birth missing (living people)