pith. machine review for the scientific record. sign in

Daniel A. Spielman

Identifiers

  • name variant Daniel A. Spielman 0.60 · backfill

Papers (24)

  1. Interlacing Families III: Sharper Restricted Invertibility Estimates math.FA · 2017 · author #2
  2. Sparsified Cholesky and Multigrid Solvers for Connection Laplacians cs.DS · 2015 · author #5
  3. Sparsified Cholesky Solvers for SDD linear systems cs.DS · 2015 · author #3
  4. Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes math.CO · 2015 · author #3
  5. Algorithms for Lipschitz Learning on Graphs cs.LG · 2015 · author #4
  6. Finite free convolutions of polynomials math.CO · 2015 · author #2
  7. Ramanujan Graphs and the Solution of the Kadison-Singer Problem math.SP · 2014 · author #2
  8. An Efficient Parallel Solver for SDD Linear Systems cs.NA · 2013 · author #2
  9. Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees math.CO · 2013 · author #2
  10. Exact Recovery of Sparsely-Used Dictionaries cs.LG · 2012 · author #1
  11. A Cheeger Inequality for the Graph Connection Laplacian math.SP · 2012 · author #3
  12. Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs cs.DS · 2010 · author #4
  13. An Elementary Proof of the Restricted Invertibility Theorem math.FA · 2009 · author #1
  14. A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning cs.DS · 2008 · author #1
  15. Spectral Sparsification of Graphs cs.DS · 2008 · author #1
  16. Faster Approximate Lossy Generalized Flow via Interior Point Algorithms cs.DS · 2008 · author #2
  17. Graph Sparsification by Effective Resistances cs.DS · 2008 · author #1
  18. Lower-Stretch Spanning Trees cs.DS · 2004 · author #3
  19. Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems cs.DS · 2003 · author #1
  20. Smoothed Analysis of Interior-Point Algorithms: Termination cs.DS · 2003 · author #1
  21. Smoothed analysis of algorithms math.OC · 2002 · author #1
  22. Exponential algorithmic speedup by quantum walk quant-ph · 2002 · author #6
  23. Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time cs.DS · 2001 · author #1
  24. An Infinite Antichain of Permutations math.CO · 1998 · author #2

Mentions

  • 0809.3232 #1 · backfill · confidence 0.70 Daniel A. Spielman
  • 0808.4134 #1 · backfill · confidence 0.70 Daniel A. Spielman
  • 0803.0988 #2 · backfill · confidence 0.70 Daniel A. Spielman
  • 0803.0929 #1 · backfill · confidence 0.70 Daniel A. Spielman

Frequent Coauthors