| 2025 | STOC | Statistical Inference of a Ranked Community in a Directed Graph. | Dmitriy Kunisky, Daniel A. Spielman, Alexander S. Wein, Xifan Yu |
| 2016 | STOC | Sparsified Cholesky and multigrid solvers for connection laplacians. | Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman |
| 2015 | COLT | Algorithms for Lipschitz Learning on Graphs. | Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman |
| 2015 | FOCS | Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. | Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava |
| 2014 | STOC | An efficient parallel solver for SDD linear systems. | Richard Peng, Daniel A. Spielman |
| 2013 | FOCS | Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees. | Adam Marcus, Daniel A. Spielman, Nikhil Srivastava |
| 2013 | IJCAI | Exact Recovery of Sparse-Used Dictionaries. | Huan Wang, Daniel A. Spielman, John Wright |
| 2012 | ICALP | Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations. | Daniel A. Spielman |
| 2011 | STOC | Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. | Paul F. Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng |
| 2009 | ICML | Fitting a graph to vector data. | Samuel I. Daitch, Jonathan A. Kelner, Daniel A. Spielman |
| 2009 | STOC | Twice-ramanujan sparsifiers. | Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava |
| 2008 | STOC | Faster approximate lossy generalized flow via interior point algorithms. | Samuel I. Daitch, Daniel A. Spielman |
| 2008 | STOC | Graph sparsification by effective resistances. | Daniel A. Spielman, Nikhil Srivastava |
| 2007 | FOCS | Spectral Graph Theory and its Applications. | Daniel A. Spielman |
| 2006 | STOC | A randomized polynomial-time simplex algorithm for linear programming. | Jonathan A. Kelner, Daniel A. Spielman |
| 2005 | FCT | The Smoothed Analysis of Algorithms. | Daniel A. Spielman |
| 2005 | FOCS | Improved Smoothed Analysis of the Shadow Vertex Simplex Method. | Amit Deshpande, Daniel A. Spielman |
| 2005 | STOC | Lower-stretch spanning trees. | Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng |
| 2004 | EuroPar | Parallel Delaunay Refinement with Off-Centers. | Daniel A. Spielman, Shang-Hua Teng, Alper ngr |
| 2004 | STOC | Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. | Daniel A. Spielman, Shang-Hua Teng |
| 2004 | SPAA | Time complexity of practical parallel steiner point insertion algorithms. | Daniel A. Spielman, Shang-Hua Teng, Alper ngr |
| 2003 | FOCS | Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m | Daniel A. Spielman, Shang-Hua Teng |
| 2003 | STOC | Exponential algorithmic speedup by a quantum walk. | Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman |
| 2003 | WADS | Smoothed Analysis (Motivation and Discrete Models). | Daniel A. Spielman, Shang-Hua Teng |
| 2001 | STOC | Randomness efficient identity testing of multivariate polynomials. | Adam R. Klivans, Daniel A. Spielman |
| 2001 | STOC | Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. | Daniel A. Spielman, Shang-Hua Teng |
| 1998 | COCOON | Min-Max-Boundary Domain Decomposition. | Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng |
| 1998 | STOC | Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman |
| 1997 | FCT | The Complexity of Error-Correcting Codes. | Daniel A. Spielman |
| 1997 | STOC | Practical Loss-Resilient Codes. | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann |
| 1996 | FOCS | Highly Fault-Tolerant Parallel Computation (extended abstract). | Daniel A. Spielman |
| 1996 | FOCS | Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. | Daniel A. Spielman, Shang-Hua Teng |
| 1996 | STOC | Faster Isomorphism Testing of Strongly Regular Graphs. | Daniel A. Spielman |
| 1995 | STOC | Linear-time encodable and decodable error-correcting codes. | Daniel A. Spielman |
| 1994 | FOCS | Expander Codes | Michael Sipser, Daniel A. Spielman |
| 1994 | STOC | Nearly-linear size holographic proofs. | Alexander Polishchuk, Daniel A. Spielman |
| 1993 | SPAA | Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds. | Richard Beigel, Grigorii Margulis, Daniel A. Spielman |
| 1991 | STOC | PP Is Closed Under Intersection (Extended Abstract) | Richard Beigel, Nick Reingold, Daniel A. Spielman |