Jump to content

Daniel Spielman

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by LJosil (talk | contribs) at 00:27, 13 March 2011. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Daniel Spielman
Nationality US
Alma materB.A.: Yale University (1992)
Ph.D.:Massachusetts Institute of Technology (1995)
Known forSmoothed analysis
AwardsGödel Prize (2008)[1]
Fulkerson Prize (2009)
Nevanlinna Prize (2010)
Scientific career
FieldsComputer Scientist
InstitutionsYale University
Doctoral advisorMichael Sipser[2]

Daniel Alan Spielman (born March 1970, Philadelphia, USA[3]) 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.[4]

In 2010, he was awarded the Nevanlinna Prize for "for smoothed analysis of Linear Programming, algorithms for graph-based codes and applications of graph theory to Numerical Computing"[5] and the same year he was named a Fellow of the Association for Computing Machinery.[6]

He holds several patents in the area of coding theory with the U.S. Patent Office.

References

  1. ^ Parberry, Ian (1999-05-10). "2008 Gödel Prize". ACM SIGACT. Retrieved 2007-02-12. [dead link]
  2. ^ Daniel Spielman at Mathematics Genealogy Project
  3. ^ Brief bio
  4. ^ Daniel Spielman profile at Yale University.
  5. ^ Rolf Nevanlinna Prize – Daniel Spielman, ICM 2010, retrieved 21 August 2010 [dead link]
  6. ^ http://www.acm.org/press-room/news-releases/2010/fellows-2010

Template:Persondata