Daniel Spielman, B.A. Yale 1992 Ph.D. MIT 1995. Joined Yale Faculty 2005.

Daniel Spielman's picture
Sterling Professor of Computer Science and Professor of Statistics and Data Science and of Mathematics
Address: 
17 Hillhouse Avenue, Room 340, New Haven, CT 06511-8937
203-436-1264

Daniel Spielman’s interests include the analysis of algorithms and heuristics, error-correcting codes, combinatorial scientific computing, spectral graph theory, and combinatorics.

Awards Daniel Spielman has received are

  • AMS Josiah Willard Gibbs Lectureship (2016)
  • Gödel Prize, awarded jointly by the ACM and EATCS (2015)
  • Polya Prize, awarded by SIAM (2014)
  • Invited speaker at International Congress of Mathematicians (2014)
  • MacArthur Fellowship (2012)
  • Simons Investigator (2012)
  • Fellow of the Association for Computing Machinery (2010)
  • Rolf Nevanlinna Prize, awarded by the IMU (2010)
  • Invited speaker at International Congress of Mathematicians (2010)
  • Fulkerson Prize, awarded jointly by the AMS and MPS (2009)
  • Gödel Prize, awarded jointly by the ACM and EATCS (2008)
  • Invited speaker at International Congress of Mathematicians (2002)
  • Alfred P. Sloan Foundation Research Fellowship (1998)
  • NSF CAREER Award (1997)

Selected Publications

  • “Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem”, Annals of Mathematics, 182 (1), pp. 327-350. 2015. With A. Marcus and N. Srivastava.
  • “Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems”. SIAM Journal on Matrix Analysis and Applications, 35 (3), pp. 835-885, 2014. With S.-H. Teng.
  • “Twice-Ramanujan Sparsifiers (Sigest)”, SIAM Review, 56 (2), 315-334, 2014. With J. Batson and N. Srivastava.
  • “A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning”. SIAM Journal on Computing, vol 42 (1), pp. 1-26, 2013. With S.-H. Teng.
  • “Smoothed Analysis of Algorithms: Why The Simplex Algorithm Usually Takes Polynomial Time,” Journal of the ACM, Vol 51 (3), pp. 385 - 463, 2004.
  • “Improved Low-Density Parity-Check Codes Using Irregular Graphs,” IEEE Transactions on Information Theory, 47(2), pp. 585-598, Feb. 2001. With M. G. Luby, M. Mitzenmacher and M. A. Shokrollahi.