Daniel Spielman

Last updated

Daniel Spielman
BornMarch 1970 (1970-03) (age 53)
NationalityAmerican
Alma mater Yale University
Massachusetts Institute of Technology
Known for Smoothed analysis
Awards Gödel Prize (2008, 2015) [1] [2]
Fulkerson Prize (2009)
Nevanlinna Prize (2010)
MacArthur Fellowship (2012) [3]
Pólya Prize (2014) [4]
Michael and Sheila Held Prize (2021) [5]
Breakthrough Prize in Mathematics (2022)
Scientific career
Fields Computer Science
Institutions Yale University
Thesis Computationally Efficient Error-Correcting Codes and Holographic Proofs (1995)
Doctoral advisor Michael Sipser [6]
Doctoral students

Daniel Alan Spielman (born March 1970 in Philadelphia, Pennsylvania [7] ) has been a professor of applied mathematics and computer science at Yale University since 2006. As of 2018, he is the Sterling Professor of Computer Science at Yale. He is also the Co-Director of the Yale Institute for Network Science, since its founding, and chair of the newly established Department of Statistics and Data Science. [8]

Contents

Education

Daniel Spielman attended The Philadelphia School, 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

Spielman and his collaborator Shang-Hua Teng have jointly won the Gödel Prize twice: in 2008 for their work on smoothed analysis of algorithms [9] and in 2015 for their work on nearly-linear-time Laplacian solvers.

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]

Related Research Articles

The IMU Abacus Medal, known before 2022 as the Rolf Nevanlinna Prize, is awarded once every four years at the International Congress of Mathematicians, hosted by the International Mathematical Union (IMU), for outstanding contributions in Mathematical Aspects of Information Sciences including:

  1. All mathematical aspects of computer science, including computational complexity theory, logic of programming languages, analysis of algorithms, cryptography, computer vision, pattern recognition, information processing and modelling of intelligence.
  2. Scientific computing and numerical analysis. Computational aspects of optimization and control theory. Computer algebra.
<span class="mw-page-title-main">Robert Tarjan</span> American computer scientist and mathematician

Robert Endre Tarjan is an American computer scientist and mathematician. He is the discoverer of several graph theory algorithms, including his strongly connected components algorithm, and co-inventor of both splay trees and Fibonacci heaps. Tarjan is currently the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University.

<span class="mw-page-title-main">Peter Shor</span> American mathematician

Peter Williston Shor is an American professor of applied mathematics at MIT. He is known for his work on quantum computation, in particular for devising Shor's algorithm, a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical computer.

<span class="mw-page-title-main">Madhu Sudan</span> Indian-American computer scientist

Madhu Sudan is an Indian-American computer scientist. He has been a Gordon McKay Professor of Computer Science at the Harvard John A. Paulson School of Engineering and Applied Sciences since 2015.

The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory. The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.

In the mathematical field of spectral graph theory, a Ramanujan graph is a regular graph whose spectral gap is almost as large as possible. Such graphs are excellent spectral expanders. As Murty's survey paper notes, Ramanujan graphs "fuse diverse branches of pure mathematics, namely, number theory, representation theory, and algebraic geometry". These graphs are indirectly named after Srinivasa Ramanujan; their name comes from the Ramanujan–Petersson conjecture, which was used in a construction of some of these graphs.

The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at each (triennial) International Symposium of the MOS. Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late Delbert Ray Fulkerson to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by MPS.

<span class="mw-page-title-main">Ehud Hrushovski</span> Israeli mathematician (born 1959)

Ehud Hrushovski is a mathematical logician. He is a Merton Professor of Mathematical Logic at the University of Oxford and a Fellow of Merton College, Oxford. He was also Professor of Mathematics at the Hebrew University of Jerusalem.

<span class="mw-page-title-main">Peter Sarnak</span> South African-born mathematician

Peter Clive Sarnak is a South African-born mathematician with dual South-African and American nationalities. Sarnak has been a member of the permanent faculty of the School of Mathematics at the Institute for Advanced Study since 2007. He is also Eugene Higgins Professor of Mathematics at Princeton University since 2002, succeeding Sir Andrew Wiles, and is an editor of the Annals of Mathematics. He is known for his work in analytic number theory. He also sits on the Board of Adjudicators and the selection committee for the Mathematics award, given under the auspices of the Shaw Prize.

<span class="mw-page-title-main">Noga Alon</span> Israeli mathematician

Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.

The Society for Industrial and Applied Mathematics (SIAM) has three prizes named after George Pólya: the George Pólya Prize for Mathematical Exposition, established in 2013; the George Pólya Prize in Applied Combinatorics, established in 1969, and first awarded in 1971; and the George Pólya Prize in Mathematics, established in 1992, to complement the exposition and applied combinatorics prizes.

<span class="mw-page-title-main">Avi Wigderson</span> Israeli mathematician and computer scientist

Avi Wigderson is an Israeli mathematician and computer scientist. He is the Herbert H. Maass Professor in the school of mathematics at the Institute for Advanced Study in Princeton, New Jersey, United States of America. His research interests include complexity theory, parallel algorithms, graph theory, cryptography, distributed computing, and neural networks. Wigderson received the Abel Prize in 2021 for his work in theoretical computer science.

<span class="mw-page-title-main">Kannan Soundararajan</span> American mathematician known for his work on analytic number theory

Kannan Soundararajan is an Indian-born American mathematician and a professor of mathematics at Stanford University. Before moving to Stanford in 2006, he was a faculty member at University of Michigan, where he had also pursued his undergraduate studies. His main research interest is in analytic number theory, particularly in the subfields of automorphic L-functions, and multiplicative number theory.

Shang-Hua Teng is a Chinese-American computer scientist. He is the Seeley G. Mudd Professor of Computer Science and Mathematics at the University of Southern California. Previously, he was the chairman of the Computer Science Department at the Viterbi School of Engineering of the University of Southern California.

<span class="mw-page-title-main">Gil Kalai</span> Israeli mathematician and computer scientist

Gil Kalai is an Israeli mathematician and computer scientist. He is the Henry and Manya Noskwith Professor Emeritus of Mathematics at the Hebrew University of Jerusalem, Israel, Professor of Computer Science at the Interdisciplinary Center, Herzliya, and adjunct Professor of mathematics and of computer science at Yale University, United States.

Alex Eskin is an American mathematician. He is the Arthur Holly Compton Distinguished Service Professor in the Department of Mathematics at the University of Chicago. His research focuses on rational billiards and geometric group theory.

<span class="mw-page-title-main">Hans Georg Feichtinger</span> Austrian mathematician

Hans Georg Feichtinger is an Austrian mathematician. He is Professor in the mathematical faculty of the University of Vienna. He is editor-in-chief of the Journal of Fourier Analysis and Applications (JFAA) and associate editor to several other journals. He is one of the founders and head of the Numerical Harmonic Analysis Group (NuHAG) at University of Vienna. Today Feichtinger's main field of research is harmonic analysis with a focus on time-frequency analysis.

Adam Wade Marcus is an American mathematician. He holds the Chair of Combinatorial Analysis in the Institute of Mathematics at the École Polytechnique Fédérale de Lausanne. The team of Marcus, Daniel Spielman and Nikhil Srivastava was awarded the Pólya Prize in 2014 for their resolution of the Kadison–Singer problem and later the Michael and Sheila Held Prize in 2021 for their solution to long-standing conjectures in the study of Ramanujan graphs.

<span class="mw-page-title-main">Nikhil Srivastava</span>

Nikhil Srivastava is an associate professor of Mathematics at University of California, Berkeley. In July 2014, he was named a recipient of the Pólya Prize with Adam Marcus and Daniel Spielman.

In mathematics, the Kadison–Singer problem, posed in 1959, was a problem in functional analysis about whether certain extensions of certain linear functionals on certain C*-algebras were unique. The uniqueness was proved in 2013.

References

  1. 2008 Godel Prize
  2. 2015 Gödel Prize
  3. "2012 MacArthur Foundation 'Genius Grant' Winners". 1 October 2012. AP. Archived from the original on October 2, 2012. Retrieved October 1, 2012.
  4. SIAM: George Pólya Prize
  5. "National Academy of Sciences – Michael and Sheila Prize".
  6. Daniel Spielman at the Mathematics Genealogy Project
  7. Brief bio
  8. "Daniel Spielman designated Sterling Professor of Computer Science". YaleNews. July 19, 2018. Retrieved July 25, 2018.
  9. Daniel Spielman's short bio at Yale University.
  10. Rolf Nevanlinna Prize – Daniel Spielman, ICM 2010, archived from the original 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 Archived April 28, 2012, at the Wayback Machine , ACM, December 7, 2010, retrieved November 20, 2011.
  12. "ICM Plenary and Invited Speakers since 1897". International Congress of Mathematicians. Archived from the original on November 8, 2017. Retrieved August 15, 2013.
  13. "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 , doi:10.4007/annals.2015.182.1.7, 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 , doi:10.4007/annals.2015.182.1.8, MR   3374963, S2CID   17580893
  16. National Academy of Sciences Members and Foreign Associates Elected, National Academy of Sciences, May 2, 2017.
  17. "Breakthrough Prize – Winners Of The 2023 Breakthrough Prizes In Life Sciences, Mathematics And Fundamental Physics Announced". breakthroughprize.org. Retrieved September 22, 2022.