Daniel Alan Spielman (born March 1970 in Philadelphia, Pennsylvania[7]) has been a professor of applied mathematics and computer science at Yale University since 2006.
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").
[12] In 2012 he was part of the inaugural class of Simons Investigators providing $660,000 for five years for curiosity driven research.
In 2013, together with Adam Marcus and Nikhil Srivastava, he provided a positive solution to the Kadison–Singer problem,[14][15] a result that was awarded the 2014 Pólya Prize.
[16] In 2022 he won the Breakthrough Prize in Mathematics "for breakthrough contributions to theoretical computer science and mathematics, including to spectral graph theory, the Kadison–Singer problem, numerical linear algebra, optimization, and coding theory.".