Daniel Spielman

Mathematics Yale University, New Haven, CT 
"Daniel Spielman"


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


Sign in to add trainee
Samuel I. Daitch grad student 2009 Yale
BETA: Related 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 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) 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
Spielman DA. (2012) Algorithms, graph theory, and the solution of laplacian linear equations Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7392: 24-26
Christiano P, Kelner JA, Madry A, et al. (2011) Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs Proceedings of the Annual Acm Symposium On Theory of Computing. 273-281
Spielman DA. (2010) Algorithms, graph theory, and linear equations in Laplacian matrices Proceedings of the International Congress of Mathematicians 2010, Icm 2010. 2698-2722
See more...