| Year |
Citation |
Score |
| 2016 |
Spielman DA. Graphs, Vectors, and Matrices Algebraic graph theory Notices of the American Mathematical Society. 63: 11-13. DOI: 10.1090/notil306 |
0.326 |
|
| 2015 |
Marcus AW, Spielman DA, Srivastava N. Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 1358-1377. DOI: 10.1137/16M106176X |
0.32 |
|
| 2014 |
Peng R, Spielman DA. An efficient parallel solver for SDD linear systems Proceedings of the Annual Acm Symposium On Theory of Computing. 333-342. DOI: 10.1145/2591796.2591832 |
0.371 |
|
| 2014 |
Batson J, Spielman DA, Srivastava N. Twice-ramanujan sparsifiers Siam Review. 56: 315-334. DOI: 10.1137/130949117 |
0.367 |
|
| 2013 |
Batson J, Spielman DA, Srivastava N, Teng SH. Spectral sparsification of graphs: Theory and algorithms Communications of the Acm. 56: 87-94. DOI: 10.1145/2492007.2492029 |
0.458 |
|
| 2013 |
Bandeira AS, Singer A, Spielman DA. A cheeger inequality for the graph connection laplacian Siam Journal On Matrix Analysis and Applications. 34: 1611-1630. DOI: 10.1137/120875338 |
0.309 |
|
| 2013 |
Spielman DA, Teng SH. A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning Siam Journal On Computing. 42: 1-26. DOI: 10.1137/080744888 |
0.427 |
|
| 2012 |
Spielman DA. 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. DOI: 10.1007/978-3-642-31585-5-5 |
0.316 |
|
| 2011 |
Christiano P, Kelner JA, Madry A, Spielman DA, Teng SH. 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. DOI: 10.1145/1993636.1993674 |
0.386 |
|
| 2010 |
Spielman DA. Algorithms, graph theory, and linear equations in Laplacian matrices Proceedings of the International Congress of Mathematicians 2010, Icm 2010. 2698-2722. |
0.425 |
|
| 2009 |
Spielman DA, Teng SH. Smoothed analysis: An attempt to explain the behavior of algorithms in practice Communications of the Acm. 52: 76-84. DOI: 10.1145/1562764.1562785 |
0.339 |
|
| 2009 |
Daitch SI, Kelner JA, Spielman DA. Fitting a graph to vector data Proceedings of the 26th International Conference On Machine Learning, Icml 2009. 201-208. DOI: 10.1145/1553374.1553400 |
0.542 |
|
| 2008 |
Daitch SI, Spielman DA. Faster approximate lossy generalized flow via interior point algorithms Proceedings of the Annual Acm Symposium On Theory of Computing. 451-460. |
0.546 |
|
| 2007 |
Spielman DA, Teng SH, Üngör A. Parallel Delaunay refinement: Algorithms and analyses International Journal of Computational Geometry and Applications. 17: 1-30. DOI: 10.1142/S0218195907002227 |
0.341 |
|
| 2007 |
Spielman DA, Teng SH. Spectral partitioning works: Planar graphs and finite element meshes Linear Algebra and Its Applications. 421: 284-305. DOI: 10.1016/j.laa.2006.07.020 |
0.356 |
|
| 2006 |
Kelner JA, Spielman DA. A randomized polynomial-time simplex algorithm for linear programming Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 51-60. |
0.341 |
|
| 2004 |
Spielman DA, Teng SH. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time Journal of the Acm. 51: 385-463. DOI: 10.1145/990308.990310 |
0.316 |
|
| 2004 |
Spielman DA, Teng SH. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 81-90. |
0.425 |
|
| 2001 |
Luby MG, Mitzenmacher M, Shokrollahi MA, Spielman DA. Efficient erasure correcting codes Ieee Transactions On Information Theory. 47: 569-584. DOI: 10.1109/18.910575 |
0.408 |
|
| 2001 |
Klivans AR, Spielman DA. Randomness efficient identity testing of multivariate polynomials Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 216-223. |
0.385 |
|
| 1997 |
Luby MG, Mitzenmacher M, Shokrollahi MA, Spielman DA, Stemann V. Practical loss-resilient codes Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 150-159. |
0.401 |
|
| 1996 |
Sipser M, Spielman DA. Expander codes Ieee Transactions On Information Theory. 42: 1710-1722. DOI: 10.1109/18.556667 |
0.671 |
|
| 1996 |
Spielman DA. Faster isomorphism testing of strongly regular graphs Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 576-584. |
0.375 |
|
| 1996 |
Spielman DA, Teng SH. Disk packings and planar separators Proceedings of the Annual Symposium On Computational Geometry. 349-358. |
0.311 |
|
| 1994 |
Feigenbaum J, Fortnow L, Lund C, Spielman D. The power of adaptiveness and additional queries in random-self-reductions Computational Complexity. 4: 158-174. DOI: 10.1007/BF01202287 |
0.497 |
|
| Show low-probability matches. |