Daniel Alan Spielman (born March 1970 in Philadelphia, Pennsylvania) has been a professor of applied mathematics and computer science at Yale University since 2006. As of 2018, he is the Sterling Professor of Computer Science at Yale. He is also the Co-Director of the Yale Institute for Network Science, since its founding, and chair of the newly established Department of Statistics and Data Science.
|Born||March 1970 49) (age|
|Alma mater||Yale University|
Massachusetts Institute of Technology
|Known for||Smoothed analysis|
|Awards||Gödel Prize (2008, 2015)|
Fulkerson Prize (2009)
Nevanlinna Prize (2010)
MacArthur Fellowship (2012)
Pólya Prize (2014)
|Thesis||Computationally Efficient Error-Correcting Codes and Holographic Proofs (1995)|
|Doctoral advisor||Michael Sipser|
Daniel Spielman attended The Philadelphia School, Episcopal Academy, and Germantown Friends School. He received his bachelor of arts degree in mathematics and computer science from Yale University in 1992 and a PhD in applied mathematics from MIT in 1995 (his dissertation was called "Computationally Efficient Error-Correcting Codes and Holographic Proofs"). He taught in the Mathematics Department at MIT from 1996 to 2005.
Spielman and his collaborator Shang-Hua Teng have jointly won the Gödel Prize twice: in 2008 for their work on smoothed analysis of algorithms and in 2015 for their work on nearly-linear-time Laplacian solvers.
In 2010 he was awarded the Nevanlinna Prize "for smoothed analysis of Linear Programming, algorithms for graph-based codes and applications of graph theory to Numerical Computing" and the same year he was named a Fellow of the Association for Computing Machinery.
In 2012 he was part of the inaugural class of Simons Investigators providing $660,000 for five years for curiosity driven research.
In October 2012, he was named a recipient of the MacArthur Fellowship.
In 2013, together with Adam Marcus and Nikhil Srivastava, he provided a positive solution to the Kadison–Singer problem, a result that was awarded the 2014 Pólya Prize.
He gave a plenary lecture at the International Congress of Mathematicians in 2010.
In 2017 he was elected to the National Academy of Sciences.
- 2008 Godel Prize
- 2015 Gödel Prize
- "2012 MacArthur Foundation 'Genius Grant' Winners". 1 October 2012. AP. Archived from the original on 2 October 2012. Retrieved 1 October 2012.
- SIAM: George Pólya Prize
- Daniel Spielman at the Mathematics Genealogy Project
- Brief bio
- "Daniel Spielman designated Sterling Professor of Computer Science". YaleNews. 2018-07-19. Retrieved 2018-07-25.
- Daniel Spielman's short bio at Yale University.
- Rolf Nevanlinna Prize – Daniel Spielman, ICM 2010, archived from the original on August 22, 2010, retrieved 21 August 2010
- ACM Names 41 Fellows from World's Leading Institutions: Many Innovations Made in Areas Critical to Global Competitiveness Archived 2012-04-28 at the Wayback Machine, ACM, December 7, 2010, retrieved 2011-11-20.
- "Simons Investigator". YaleNews.
- Marcus, Adam W.; Spielman, Daniel A.; Srivastava, Nikhil (2015), "Interlacing families I: Bipartite Ramanujan graphs of all degrees", Annals of Mathematics, 182 (1): 307–325, arXiv:1304.4132, doi:10.4007/annals.2015.182.1.7, MR 3374962
- Marcus, Adam W.; Spielman, Daniel A.; Srivastava, Nikhil (2015), "Interlacing Families II: Mixed Characteristic Polynomials and the Kadison–Singer problem", Annals of Mathematics, 182 (1): 327–350, arXiv:1306.3969, doi:10.4007/annals.2015.182.1.8, MR 3374963
- "ICM Plenary and Invited Speakers since 1897". International Congress of Mathematicians.
- National Academy of Sciences Members and Foreign Associates Elected, National Academy of Sciences, May 2, 2017.