Daniel Spielman
Daniel Spielman
| Daniel Spielman | |
|---|---|
| Residence |  U.S. |
| Nationality | US |
| Fields | Computer Scientist |
| Institutions | Yale University |
| Alma mater | B.A.: Yale University (1992) Ph.D.:Massachusetts Institute of Technology (1995) |
| Doctoral advisor | Michael Sipser |
| Known for | Smoothed analysis |
| Notable awards | Gödel Prize (2008) Fulkerson Prize (2009) Nevanlinna Prize (2010) |
Daniel Alan Spielman (born March 1970, Philadelphia, USA) is professor of Applied Mathematics and Computer Science at Yale University (since 2006).
Daniel Spielman attended The Philadelphia School. He received his B.A. in mathematics and computer science from Yale University in 1992 and his Ph.D. in applied mathematics (dissertation: Computationally Efficient Error-Correcting Codes and Holographic Proofs) from MIT in 1995. He taught in the Mathematics Department at MIT during 1996-2005.
In 2008 he was awarded the Gödel Prize for his joint work on smoothed analysis of algorithms.
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.
He holds several patents in the area of coding theory with the U.S. Patent Office.
- ^ Daniel Spielman at Mathematics Genealogy Project
- ^ Parberry, Ian (1999-05-10). "2008 Gödel Prize". ACM SIGACT. http://sigact.acm.org/prizes/godel/2008.html. Retrieved 2007-02-12.[dead link]
- ^ Brief bio
- ^ Daniel Spielman profile at Yale University.
- ^ Rolf Nevanlinna Prize – Daniel Spielman, ICM 2010, http://www.icm2010.org.in/imu-prizes/prize-winners-2010/rolf-nevanlinna-prize-daniel-spielman, retrieved 21 August 2010[dead link]
- ^ http://www.acm.org/press-room/news-releases/2010/fellows-2010
|
|||||