Daniel Spielman

From Wikipedia, the free encyclopedia
Jump to: navigation, search
For the Australian actor, see Dan Spielman.
Daniel Spielman
Born March 1970 (1970-03) (age 47)
Philadelphia, Pennsylvania
Nationality U.S.
Fields Computer Scientist
Institutions Yale University
Alma mater Yale University
MIT
Thesis Computationally Efficient Error-Correcting Codes and Holographic Proofs (1995)
Doctoral advisor Michael Sipser[1]
Doctoral students Jonathan Kelner
Nikhil Srivastava
Known for Smoothed analysis
Notable awards

Gödel Prize (2008, 2015)[2][3]
Fulkerson Prize (2009)
Nevanlinna Prize (2010)
MacArthur Fellowship (2012)[4]

Pólya Prize (2014)[5]

Daniel Alan Spielman (born March 1970 in Philadelphia, Pennsylvania[6]) 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.

Education[edit]

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.

Awards[edit]

In 2008 he was awarded the Gödel Prize for his joint work on smoothed analysis of algorithms.[7]

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"[8] and the same year he was named a Fellow of the Association for Computing Machinery.[9]

In 2012 he was part of the inaugural class of Simons Investigators providing $660,000 for five years for curiosity driven research.[10]

In 2013, together with Adam Marcus and Nikhil Srivastava, he provided a positive solution to the Kadison–Singer problem,[11][12] a result that was awarded the 2014 Pólya Prize.

He gave a plenary lecture at the International Congress of Mathematicians in 2010.[13]

References[edit]

  1. ^ Daniel Spielman at the Mathematics Genealogy Project
  2. ^ Parberry, Ian (1999-05-10). "2008 Gödel Prize". ACM SIGACT. Archived from the original on March 28, 2009. Retrieved 2007-02-12. 
  3. ^ http://www.sigact.org/Prizes/Godel/citation2015.pdf
  4. ^ "2012 MacArthur Foundation 'Genius Grant' Winners". 1 October 2012. AP. Retrieved 1 October 2012. [permanent dead link]
  5. ^ SIAM: George Pólya Prize
  6. ^ Brief bio
  7. ^ Daniel Spielman's short bio at Yale University.
  8. ^ Rolf Nevanlinna Prize – Daniel Spielman, ICM 2010, archived from the original on August 22, 2010, retrieved 21 August 2010 
  9. ^ 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.
  10. ^ "Simons Investigator". YaleNews. 
  11. ^ 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.4132Freely accessible, doi:10.4007/annals.2015.182.1.7, MR 3374962 
  12. ^ 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.3969Freely accessible, doi:10.4007/annals.2015.182.1.8, MR 3374963 
  13. ^ "ICM Plenary and Invited Speakers since 1897". International Congress of Mathematicians.