Daniel Spielman
<templatestyles src="Module:Hatnote/styles.css"></templatestyles>
| Daniel Spielman | |
|---|---|
| Born | March 1970 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
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
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
- ↑ Daniel Spielman at the Mathematics Genealogy Project
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ http://www.sigact.org/Prizes/Godel/citation2015.pdf
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ SIAM: George Pólya Prize
- ↑ Brief bio
- ↑ Daniel Spielman's short bio at Yale University.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ 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.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
<templatestyles src="Asbox/styles.css"></templatestyles>
- American computer scientists
- Researchers in geometric algorithms
- 1970 births
- Living people
- MacArthur Fellows
- Gödel Prize laureates
- Nevanlinna Prize laureates
- Fellows of the Association for Computing Machinery
- Scientists from Pennsylvania
- Massachusetts Institute of Technology faculty
- Yale University faculty
- Massachusetts Institute of Technology alumni
- Yale University alumni
- People from Philadelphia, Pennsylvania
- Jewish American scientists
- Computer scientist stubs
