Michael B. Cohen

from Wikipedia, the free encyclopedia

Michael Benjamin Cohen (* 1992 ; † September 2017 ) was an American computer scientist and mathematician.

Cohen graduated from Montgomery Blair High School in 2010 and then graduated from Massachusetts Institute of Technology with a bachelor's degree in 2014. He spent a year as a scientist at Facebook , earned his master’s degree from MIT in 2016, and was on the MIT doctoral program ( at CSAIL ). In 2017 he conducted research at Microsoft Research and at the time of his death was a visiting researcher (Simons Fellow) at the Simons Institute for the Theory of Computing at the University of California, Berkeley . He died of a complication of diabetes ( ketoacidosis ).

He was seen as a promising emerging talent in theoretical computer science. His best known result is the construction in polynomial time of bipartite Ramanujan graphs for all degrees and sizes. Their existence had previously been proven by Daniel Spielman , Nikhil Srivastava and Adam W. Marcus .

One focus of his research was matrix problems and algorithms, for example he was part of a team that found the fastest algorithm for solving linear systems of the SDD type (symmetrical, diagonal dominated) and he researched matrix approximation via subsampling. Most recently, he dealt with online learning and online algorithms as well as the K server problem , an important unsolved problem in computer science.

Fonts

Except for the works cited in the footnotes

  • with Sam Elder and others: Dimensionality reduction for k-means clustering and low rank approximation, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing 2015, pp. 163–172
  • with Yin Tat Lee u. a .: Geometric median in nearly linear time, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing 2016, pp. 9-21

Web links

Individual evidence

  1. ^ Cohen, Ramanujan graphs in polynomial time, Arxiv 2016 . Foundations of Computer Science (FOCS), 2016.
  2. ↑ Marcus, Spielman, Srivastava: Ramanujan Graphs and the Solution of the Kadison-Singer Problem, Proc. ICM 2014
  3. ↑ Cohen et al. a., Solving SDD linear systems in nearly m log 1/2 n time, Proceedings of the 46th Annual ACM Symposium on Theory of Computing, 2014, pp. 343-352
  4. ↑ Cohen et al. a .: Uniform Sampling for Matrix Approximation, Arxiv 2014 , Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science.


personal data
SURNAME Cohen, Michael B.
ALTERNATIVE NAMES Cohen, Michael Benjamin
BRIEF DESCRIPTION American mathematician and computer scientist
DATE OF BIRTH 1992
DATE OF DEATH September 2017