Daniel Spielman
Daniel Spielman · Technology & Engineering
Breakthroughs in coding theory and algorithm analysis.
1970, Philadelphia, Pennsylvania, USA
United States
Daniel Spielman is recognized among Jewish contributors to Technology & Engineering — Breakthroughs in coding theory and algorithm analysis.
Spielman is a Yale mathematician and computer scientist known for fast-decodable error-correcting codes, spectral graph theory and nearly-linear-time Laplacian solvers, the smoothed analysis of algorithms, and the solution (with Adam Marcus and Nikhil Srivastava) of the Kadison–Singer problem. He was born to a Jewish family in Philadelphia.
Verify and go deeper with these external references.
Source: Jinfo.org — Jews in Computer Science
This page is published in seven languages from an English source. The translations are reviewed, but a mistake can still slip through. If you spot one on this profile — a wrong word, a lost date, a sentence that says something the English does not — please tell us.
Breakthroughs in coding theory and algorithm analysis.
Source: Jinfo.org — Jews in Computer Science
Similar Contributors
Abraham Charnes
Frank Proschan
Herbert Scarf
Jon Kleinberg
