Scribd
Upload
26 views3 pages

Daniel Spielman

Uploaded by

justin.bieber.mac
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views3 pages

Daniel Spielman

Uploaded by

justin.bieber.mac
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Daniel Spielman

Daniel Alan Spielman (born March 1970 in


Philadelphia, Pennsylvania[7]) has been a professor of Daniel Spielman
applied mathematics and computer science at Yale Born March 1970 (age 54)
University since 2006. As of 2018, he is the Sterling Philadelphia, Pennsylvania,
Professor of Computer Science at Yale. He is also the U.S.
Co-Director of the Yale Institute for Network Science, Alma mater Yale University
since its founding, and chair of the newly established Massachusetts Institute of
Department of Statistics and Data Science.[8] Technology
Known for Smoothed analysis
Awards Gödel Prize (2008, 2015)[1][2]
Education Fulkerson Prize (2009)
Nevanlinna Prize (2010)
Daniel Spielman attended The Philadelphia School,
MacArthur Fellowship (2012)[3]
and Germantown Friends School. He received his
Pólya Prize (2014)[4]
bachelor of arts degree in mathematics and computer
Michael and Sheila Held Prize
science from Yale University in 1992 and a PhD in
(2021)[5]
applied mathematics from MIT in 1995 (his
Breakthrough Prize in
dissertation was called "Computationally Efficient
Mathematics (2022)
Error-Correcting Codes and Holographic Proofs"). He
taught in the Mathematics Department at MIT from Scientific career
1996 to 2005. Fields Computer Science
Institutions Yale University
Thesis Computationally Efficient Error-
Awards Correcting Codes and
Holographic Proofs (1995)
Spielman and his collaborator Shang-Hua Teng have
Doctoral Michael Sipser[6]
jointly won the Gödel Prize twice: in 2008 for their
advisor
work on smoothed analysis of algorithms[9] and in
2015 for their work on nearly-linear-time Laplacian Doctoral Nikhil Srivastava
solvers. students

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

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

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

In October 2012, he was named a recipient of the MacArthur Fellowship.


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

In 2017 he was elected to the National Academy of Sciences.[16]

In 2022 he won the Breakthrough Prize in Mathematics "for breakthrough contributions to theoretical
computer science and mathematics, including to spectral graph theory, the Kadison–Singer problem,
numerical linear algebra, optimization, and coding theory.".[17]

References
1. 2008 Godel Prize (http://www.sigact.org/prizes/g%C3%B6del/2008.html)
2. 2015 Gödel Prize (http://www.sigact.org/prizes/g%C3%B6del/citation2015.pdf)
3. "2012 MacArthur Foundation 'Genius Grant' Winners" (https://web.archive.org/web/2012100
2000603/http://bigstory.ap.org/article/2012-macarthur-foundation-genius-grant-winners). 1
October 2012. AP. Archived from the original (http://bigstory.ap.org/article/2012-macarthur-fo
undation-genius-grant-winners#overlay-context=users/rjagodzinski) on October 2, 2012.
Retrieved October 1, 2012.
4. SIAM: George Pólya Prize (http://www.siam.org/prizes/sponsored/polya.php)
5. "National Academy of Sciences – Michael and Sheila Prize" (http://www.nasonline.org/progr
ams/awards/michael-and-sheila-held-prize.html).
6. Daniel Spielman (https://mathgenealogy.org/id.php?id=65065) at the Mathematics
Genealogy Project
7. Brief bio (http://www.cs.yale.edu/homes/spielman/bio.txt)
8. "Daniel Spielman designated Sterling Professor of Computer Science" (https://news.yale.ed
u/2018/07/19/daniel-spielman-designated-sterling-professor-computer-science). YaleNews.
July 19, 2018. Retrieved July 25, 2018.
9. Daniel Spielman's short bio (http://www.cs.yale.edu/homes/spielman/bio.txt) at Yale
University.
10. Rolf Nevanlinna Prize – Daniel Spielman (https://web.archive.org/web/20100822155454/htt
p://www.icm2010.org.in/imu-prizes/prize-winners-2010/rolf-nevanlinna-prize-daniel-spielma
n), ICM 2010, archived from the original (http://www.icm2010.org.in/imu-prizes/prize-winners
-2010/rolf-nevanlinna-prize-daniel-spielman) on August 22, 2010, retrieved August 21, 2010
11. ACM Names 41 Fellows from World's Leading Institutions: Many Innovations Made in Areas
Critical to Global Competitiveness (http://www.acm.org/press-room/news-releases/2010/fello
ws-2010) Archived (https://web.archive.org/web/20120428113630/http://www.acm.org/press
-room/news-releases/2010/fellows-2010) April 28, 2012, at the Wayback Machine, ACM,
December 7, 2010, retrieved November 20, 2011.
12. "ICM Plenary and Invited Speakers since 1897" (https://web.archive.org/web/201711080121
53/http://www.mathunion.org/db/ICM/Speakers/SortedByCongress.php). International
Congress of Mathematicians. Archived from the original (http://www.mathunion.org/db/ICM/
Speakers/SortedByCongress.php) on November 8, 2017. Retrieved August 15, 2013.
13. "Simons Investigator" (http://news.yale.edu/2012/07/26/computer-scientist-daniel-spielman-
named-inaugural-simons-investigator). YaleNews.
14. 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 (https://arxiv.org/abs/1304.4132), doi:10.4007/annals.2015.182.1.7 (https://
doi.org/10.4007%2Fannals.2015.182.1.7), MR 3374962 (https://mathscinet.ams.org/mathsci
net-getitem?mr=3374962)
15. 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 (https://arxiv.org/abs/1306.3969),
doi:10.4007/annals.2015.182.1.8 (https://doi.org/10.4007%2Fannals.2015.182.1.8),
MR 3374963 (https://mathscinet.ams.org/mathscinet-getitem?mr=3374963),
S2CID 17580893 (https://api.semanticscholar.org/CorpusID:17580893)
16. National Academy of Sciences Members and Foreign Associates Elected (http://www.nasonl
ine.org/news-and-multimedia/news/may-2-2017-NAS-Election.html), National Academy of
Sciences, May 2, 2017.
17. "Breakthrough Prize – Winners Of The 2023 Breakthrough Prizes In Life Sciences,
Mathematics And Fundamental Physics Announced" (https://breakthroughprize.org/News/7
3). breakthroughprize.org. Retrieved September 22, 2022.

External links
Yale faculty homepage (http://cs-www.cs.yale.edu/homes/spielman/)

Retrieved from "https://en.wikipedia.org/w/index.php?title=Daniel_Spielman&oldid=1254927133"

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy