World's Best Scientists 2026 revealed!
Daniel A. Spielman

Daniel A. Spielman

D-Index & Metrics

Computer Science

D-Index
58
Citations
21842
World Ranking
3545
National Ranking
1705

Mathematics

D-Index
58
Citations
21842
World Ranking
616
National Ranking
309

Research.com Recognitions

  • 2017 - Member of the National Academy of Sciences
  • 2014 - George Pólya Prize
  • 2010 - ACM Fellow For contributions to the design and analysis of algorithms.
  • 2010 - Rolf Nevanlinna Prize
  • 1998 - Fellow of Alfred P. Sloan Foundation

Overview

Daniel A. Spielman is a researcher affiliated with Yale University in the United States. Their work spans across multiple fields, primarily focusing on Mathematics and Computer Science.

Their research covers key subfields including:

  • Statistics and Probability
  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Discrete Mathematics and Combinatorics
  • Mathematical Physics

The main topics addressed in their work consist of:

  • Matrix Theory and Algorithms
  • Random Matrices and Applications
  • Advanced Combinatorial Mathematics
  • Advanced Algebra and Geometry
  • Statistical Methods in Clinical Trials
  • Advanced Causal Inference Techniques
  • Statistical Methods and Inference

Frequent coauthors of Daniel A. Spielman include:

  • Adam W. Marcus
  • Nikhil Srivastava
  • Dmitriy Kunisky
  • Xifan Yu
  • Christopher Harshaw

The venues where their research has been published most frequently include:

  • arXiv (Cornell University)
  • Probability Theory and Related Fields
  • Journal of the American Statistical Association
  • Israel Journal of Mathematics
  • Notices of the American Mathematical Society

Notable recent papers by Daniel A. Spielman are:

  • Finite free convolutions of polynomials, 2022, Probability Theory and Related Fields
  • Balancing Covariates in Randomized Experiments with the Gram-Schmidt Walk Design, 2023, Journal of the American Statistical Association
  • Interlacing families III: Sharper restricted invertibility estimates, 2021, Israel Journal of Mathematics
  • Robust and Practical Solution of Laplacian Equations by Approximate Elimination, 2023, arXiv (Cornell University)
  • Isadore M. Singer (1924-2021) In Memoriam Part 1: Scientific Works, 2022, Notices of the American Mathematical Society

Daniel A. Spielman has received several awards, including:

  • Member of the National Academy of Sciences, 2017
  • George Pólya Prize, 2014
  • ACM Fellow, 2010, for contributions to the design and analysis of algorithms
  • Rolf Nevanlinna Prize, 2010
  • Fellow of Alfred P. Sloan Foundation, 1998

Best Publications

  • Efficient erasure correcting codes

    M.G. Luby;M. Mitzenmacher;M.A. Shokrollahi;D.A. Spielman

  • Expander codes

    M. Sipser;D.A. Spielman

  • Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time

    Daniel A. Spielman;Shang-Hua Teng

  • Improved low-density parity-check codes using irregular graphs

    M.G. Luby;M. Mitzenmacher;M.A. Shokrollahi;D.A. Spielman

  • Practical loss-resilient codes

    Michael G. Luby;Michael Mitzenmacher;M. Amin Shokrollahi;Daniel A. Spielman

  • Graph Sparsification by Effective Resistances

    Daniel A. Spielman;Nikhil Srivastava

  • Spectral Graph Theory and its Applications

    D.A. Spielman

  • Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

    Daniel A. Spielman;Shang-Hua Teng

  • Exponential algorithmic speedup by a quantum walk

    Andrew M. Childs;Richard Cleve;Enrico Deotto;Edward Farhi

  • Linear-time encodable and decodable error-correcting codes

    D.A. Spielman

  • Spectral Sparsification of Graphs

    Daniel A. Spielman;Shang-Hua Teng

  • Twice-Ramanujan Sparsifiers

    Joshua D. Batson;Daniel A. Spielman;Nikhil Srivastava

  • Analysis of low density codes and improved designs using irregular graphs

    M. Luby;M. Mitzenmacher;A. Shokrollah;D. Spielman

  • Interlacing families II: Mixed characteristic polynomials and the Kadison{Singer problem

    Adam W. Marcus;Daniel A. Spielman;Nikhil Srivastava

  • Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems

    Daniel A. Spielman;Shang-Hua Teng

  • Interlacing families I: bipartite Ramanujan graphs of all degrees

    Adam Wade Marcus;Daniel A. Spielman;Nikhil Srivastava

  • Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs

    Paul Christiano;Jonathan A. Kelner;Aleksander Madry;Daniel A. Spielman

  • A LOCAL CLUSTERING ALGORITHM FOR MASSIVE GRAPHS AND ITS APPLICATION TO NEARLY LINEAR TIME GRAPH PARTITIONING

    Daniel A. Spielman;Shang-Hua Teng

  • Exponential algorithmic speedup by quantum walk

    Andrew M. Childs;Richard Cleve;Enrico Deotto;Edward Farhi

  • Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices

    Arvind Sankar;Daniel A. Spielman;Shang-Hua Teng

  • Spectral partitioning works : Planar graphs and finite element meshes

    Daniel A. Spielman;Shang-Hua Teng

  • Improved low-density parity-check codes using irregular graphs and belief propagation

    M.G. Luby;M. Amin Shokrolloahi;M. Mizenmacher;D.A. Spielman

Frequent Co-Authors

Shang-Hua Teng
Shang-Hua Teng University of Southern California
Michael Luby
Michael Luby BitRipple
Michael Mitzenmacher
Michael Mitzenmacher Harvard University
Richard Peng
Richard Peng Carnegie Mellon University
Richard Beigel
Richard Beigel Temple University
Carsten Lund
Carsten Lund AT&T (United States)
John Dunagan
John Dunagan Microsoft (United States)
Michael Elkin
Michael Elkin Ben-Gurion University of the Negev
Ming Cao
Ming Cao University of Groningen
Yin Tat Lee
Yin Tat Lee Microsoft (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students pursuing mathematics in the USA, exploring related online degrees can open diverse career pathways. Many professionals complement their mathematical background with business acumen through one year MBA program options that provide intensive, focused training to accelerate career growth.

If you are considering further education but want flexibility, several reputable online MBA accepting transfer credits allow students to leverage previous coursework while advancing their qualifications without starting from scratch. This approach is especially helpful for math graduates seeking to combine analytical skills with leadership capabilities.

As data continues to drive industries, enrolling in data analytics masters programs offers a natural extension for math majors. These programs emphasize statistical techniques and computational tools, equipping graduates to break into booming fields like data science and machine learning.

For those seeking an accessible entry point into graduate business education, identifying the easiest MBA programs to get into can ensure a smoother admissions process while still gaining valuable credentials. This can be a strategic move for math students aiming to diversify their skillset efficiently.

Best Scientists Citing Daniel A. Spielman

Trending Scientists

Recently Published Articles