Daniel Spielman

from Wikipedia, the free encyclopedia

Daniel Alan Spielman (born March 1970 in Philadelphia ) is an American mathematician and computer scientist.

Professional career

Spielman studied mathematics and computer science at Yale University (Bachelor 1992) and received his PhD in Applied Mathematics from the Massachusetts Institute of Technology (MIT) with Michael Sipser in 1995 ( Computationally Efficient Error-Correcting Codes and Holographic Proofs ), for which he received the Doctoral Dissertation Award from ACM received. As a post-doc he was at the University of California, Berkeley and from 1997 to 2005 again at MIT. Since 2006 he has been Professor of Applied Mathematics and Computer Science at Yale.

Spielman deals with the design and analysis of algorithms, learning from automata, graph theory, error-correcting codes and combinatorial scientific computing. In particular, he and Shang-Hua Teng developed the concept of the smoothed analysis of the efficiency of algorithms, which is based on a random variation of the analysis due to the worst possible case. With Nikhil Srivastava and Adam W. Marcus , he solved the Kadison-Singer problem in 2013 and proved the existence of bipartite Ramanujan graphs for all degrees and sizes.

Awards

In 1998 he received a grant from the Alfred P. Sloan Foundation ( Sloan Research Fellowship ). In 2002 he was invited speaker at the ICM in Beijing ( Smoothed analysis of algorithms with Shang-Hua Teng ) and received the IEEE Information Theory Society Paper Award. In 2008 he received the Gödel Prize , in 2009 the Fulkerson Prize . In 2010 he received the Nevanlinna Prize for new error-correcting codes based on expander graphs with applications, for example on the Internet. In 2012 Spielman received a MacArthur Fellowship . In 2014 he was invited speaker at the ICM in Seoul ( Ramanujan graphs and the solution of the Kadison – Singer problem with Adam W. Marcus , Nikhil Srivastava ). For 2014 he was also awarded the George Pólya Prize , for 2015 the Gödel Prize again, also with Shang-Hua Teng. In January 2016 he gave the Gibbs Lecture of the AMS, in 2017 he was elected to the National Academy of Sciences .

Fonts

  • Graphs, Vectors and Matrices, Bulletin AMS 2016, Online

Web links

Individual evidence

  1. ↑ Daniel Spielman in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. ↑ Spielman, Teng: Smoothed Analysis of Algorithms: Why The Simplex Algorithm Usually Takes Polynomial Time. Proceedings of the Thirty-Third Annual ACM Symposium on the Theory of Computing, ACM, 2001, pp. 296-305.
  3. ↑ Spielman, Teng: Smoothed Analysis of Algorithms: Why The Simplex Algorithm Usually Takes Polynomial Time. Journal of the ACM, Volume 51, 2004, pp. 385-463
  4. ↑ Marcus, Spielman, Srivastava: Ramanujan Graphs and the Solution of the Kadison-Singer Problem, Proc. ICM 2014
  5. ^ Rolf Nevanlinna Prize - Daniel Spielman. ( Memento of March 7, 2012 in the Internet Archive ) Laudation.
personal data
SURNAME Spielman, Daniel
ALTERNATIVE NAMES Spielman, Daniel Alan (full name)
BRIEF DESCRIPTION American mathematician and computer scientist
DATE OF BIRTH March 1970
PLACE OF BIRTH Philadelphia