|Alma mater||Yale University
|Thesis||Computationally Efficient Error-Correcting Codes and Holographic Proofs (1995)|
|Doctoral advisor||Michael Sipser|
|Doctoral students||Jonathan Kelner
|Known for||Smoothed analysis|
|Notable awards||Pólya Prize (2014)|
Daniel Alan Spielman (born March 1970 in Philadelphia, Pennsylvania) has been a professor of Applied Mathematics and Computer Science at Yale University since 2006. In October 2012 he was named a recipient of the MacArthur Fellowship, commonly known as the "Genius Grant".
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.
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.
- Daniel Spielman at the Mathematics Genealogy Project
- Parberry, Ian (1999-05-10). "2008 Gödel Prize". ACM SIGACT. Retrieved 2007-02-12.[dead link]
- "2012 MacArthur Foundation 'Genius Grant' Winners". 1 October 2012. AP. Retrieved 1 October 2012.
- SIAM: George Pólya Prize
- Brief bio
- Daniel Spielman's short bio at Yale University.
- Rolf Nevanlinna Prize – Daniel Spielman, ICM 2010, retrieved 21 August 2010[dead link]
- ACM Names 41 Fellows from World's Leading Institutions: Many Innovations Made in Areas Critical to Global Competitiveness, 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
- 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
- "ICM Plenary and Invited Speakers since 1897". International Congress of Mathematicians.
|P ≟ NP||This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.|