Daniel Spielman

Affiliations: 
Mathematics Yale University, New Haven, CT 
Google:
"Daniel Spielman"

Parents

Sign in to add mentor
Michael Sipser grad student MIT (Computer Science Tree)

Children

Sign in to add trainee
Samuel I. Daitch grad student 2009 Yale
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Spielman DA. (2016) Graphs, Vectors, and Matrices Algebraic graph theory Notices of the American Mathematical Society. 63: 11-13
Marcus AW, Spielman DA, Srivastava N. (2015) Interlacing families II: Mixed characteristic polynomials and the Kadison-Singer problem Annals of Mathematics. 182: 327-350
Marcus AW, Spielman DA, Srivastava N. (2015) Interlacing families I: Bipartite Ramanujan graphs of all degrees Annals of Mathematics. 182: 307-325
Marcus AW, Spielman DA, Srivastava N. (2015) Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 1358-1377
Peng R, Spielman DA. (2014) An efficient parallel solver for SDD linear systems Proceedings of the Annual Acm Symposium On Theory of Computing. 333-342
Batson J, Spielman DA, Srivastava N. (2014) Sigest Siam Review. 56: 313
Batson J, Spielman DA, Srivastava N. (2014) Twice-ramanujan sparsifiers Siam Review. 56: 315-334
Batson J, Spielman DA, Srivastava N, et al. (2013) Spectral sparsification of graphs: Theory and algorithms Communications of the Acm. 56: 87-94
Bandeira AS, Singer A, Spielman DA. (2013) A cheeger inequality for the graph connection laplacian Siam Journal On Matrix Analysis and Applications. 34: 1611-1630
Spielman DA, Teng SH. (2013) A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning Siam Journal On Computing. 42: 1-26
See more...