The Perceptron Strikes Back. - Richard Beigel; Nick Reingold; Daniel A. Spielman (SCT, 1991)

PP Is Closed Under Intersection (Extended Abstract) - Richard Beigel; Nick Reingold; Daniel A. Spielman (STOC, 1991)

Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds. - Richard Beigel; Grigorii Margulis; Daniel A. Spielman (SPAA, 1993)

Nearly-linear size holographic proofs. - Alexander Polishchuk; Daniel A. Spielman (STOC, 1994)

The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. - Joan Feigenbaum; Lance Fortnow; Carsten Lund; Daniel A. Spielman (Comput. Complex., 1994)

PP Is Closed under Intersection. - Richard Beigel; Nick Reingold; Daniel A. Spielman (J. Comput. Syst. Sci., 1995)

Disk Packings and Planar Separators. - Daniel A. Spielman; Shang-Hua Teng (SCG, 1996)

Highly Fault-Tolerant Parallel Computation (extended abstract). - Daniel A. Spielman (FOCS, 1996)

Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. - Daniel A. Spielman; Shang-Hua Teng (FOCS, 1996)

Faster Isomorphism Testing of Strongly Regular Graphs. - Daniel A. Spielman (STOC, 1996)

Expander codes. - Michael Sipser; Daniel A. Spielman (IEEE Trans. Inf. Theory, 1996)

Linear-time encodable and decodable error-correcting codes. - Daniel A. Spielman (IEEE Trans. Inf. Theory, 1996)

The Complexity of Error-Correcting Codes. - Daniel A. Spielman (FCT, 1997)

Practical Loss-Resilient Codes. - Michael Luby; Michael Mitzenmacher; Mohammad Amin Shokrollahi; Daniel A. Spielman; Volker Stemann (STOC, 1997)

A Remark on Matrix Rigidity. - Mohammad Amin Shokrollahi; Daniel A. Spielman; Volker Stemann (Inf. Process. Lett., 1997)

Models of Computation in Coding Theory. - Daniel A. Spielman (CCC, 1998)

Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. - Michael Luby; Michael Mitzenmacher; Mohammad Amin Shokrollahi; Daniel A. Spielman (STOC, 1998)

Alternation in interaction. - Marcos A. Kiwi; Carsten Lund; Daniel A. Spielman; Alexander Russell; Ravi Sundaram (Comput. Complex., 2000)

An Infinite Antichain of Permutations. - Daniel A. Spielman; Miklós Bóna (Electron. J. Comb., 2000)

Randomness efficient identity testing of multivariate polynomials. - Adam R. Klivans; Daniel A. Spielman (STOC, 2001)

Min-max-boundary domain decomposition. - Marcos A. Kiwi; Daniel A. Spielman; Shang-Hua Teng (Theor. Comput. Sci., 2001)

Introduction to the special issue on codes on graphs and iterative algorithms. - Brendan J. Frey; Ralf Koetter; G. David Forney Jr.; Frank R. Kschischang; Robert J. McEliece; Daniel A. Spielman (IEEE Trans. Inf. Theory, 2001)

Efficient erasure correcting codes. - Michael Luby; Michael Mitzenmacher; Mohammad Amin Shokrollahi; Daniel A. Spielman (IEEE Trans. Inf. Theory, 2001)

Improved low-density parity-check codes using irregular graphs. - Michael Luby; Michael Mitzenmacher; Mohammad Amin Shokrollahi; Daniel A. Spielman (IEEE Trans. Inf. Theory, 2001)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31). - Daniel A. Spielman; Shang-Hua Teng (FOCS, 2003)

Exponential algorithmic speedup by a quantum walk. - Andrew M. Childs; Richard Cleve; Enrico Deotto; Edward Farhi; Sam Gutmann; Daniel A. Spielman (STOC, 2003)

Smoothed Analysis (Motivation and Discrete Models). - Daniel A. Spielman; Shang-Hua Teng (WADS, 2003)

Smoothed Analysis of Interior-Point Algorithms: Termination - Daniel A. Spielman; Shang-Hua Teng (CoRR, 2003)

Smoothed Analysis of Interior-Point Algorithms: Condition Number - John Dunagan; Daniel A. Spielman; Shang-Hua Teng (CoRR, 2003)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31) - Daniel A. Spielman; Shang-Hua Teng (CoRR, 2003)

Smoothed analysis of termination of linear programming algorithms. - Daniel A. Spielman; Shang-Hua Teng (Math. Program., 2003)

Parallel Delaunay Refinement with Off-Centers. - Daniel A. Spielman; Shang-Hua Teng; Alper Üngör (Euro-Par, 2004)

Time complexity of practical parallel steiner point insertion algorithms. - Daniel A. Spielman; Shang-Hua Teng; Alper Üngör (SPAA, 2004)

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. - Daniel A. Spielman; Shang-Hua Teng (STOC, 2004)

Lower-Stretch Spanning Trees - Michael Elkin; Daniel A. Spielman; Shang-Hua Teng (CoRR, 2004)

Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. - Daniel A. Spielman; Shang-Hua Teng (J. ACM, 2004)

A Lower Bound on Convergence of a Distributed Network Consensus Algorithm. - Ming Cao 001; Daniel A. Spielman; A. Stephen Morse (CDC/ECC, 2005)

The Smoothed Analysis of Algorithms. - Daniel A. Spielman (FCT, 2005)

Improved Smoothed Analysis of the Shadow Vertex Simplex Method. - Amit Deshpande 001; Daniel A. Spielman (FOCS, 2005)

A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version) - Jonathan A. Kelner; Daniel A. Spielman (Electron. Colloquium Comput. Complex., 2005)

A randomized polynomial-time simplex algorithm for linear programming. - Jonathan A. Kelner; Daniel A. Spielman (STOC, 2006)

Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices. - Arvind Sankar; Daniel A. Spielman; Shang-Hua Teng (SIAM J. Matrix Anal. Appl., 2006)

Spectral Graph Theory and its Applications. - Daniel A. Spielman (FOCS, 2007)

Support-Graph Preconditioners for 2-Dimensional Trusses - Samuel I. Daitch; Daniel A. Spielman (CoRR, 2007)

Parallel Delaunay Refinement: Algorithms and Analyses. - Daniel A. Spielman; Shang-Hua Teng; Alper Üngör (Int. J. Comput. Geom. Appl., 2007)

Faster approximate lossy generalized flow via interior point algorithms. - Samuel I. Daitch; Daniel A. Spielman (STOC, 2008)

Lower-Stretch Spanning Trees. - Michael Elkin; Yuval Emek; Daniel A. Spielman; Shang-Hua Teng (SIAM J. Comput., 2008)

A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix. - Samuel I. Daitch; Daniel A. Spielman (Combinatorial Scientific Computing, 2009)

Fitting a graph to vector data. - Samuel I. Daitch; Jonathan A. Kelner; Daniel A. Spielman (ICML, 2009)

Technical perspective - The beauty of error-correcting codes. - Daniel A. Spielman (Commun. ACM, 2009)

Smoothed analysis: an attempt to explain the behavior of algorithms in practice. - Daniel A. Spielman; Shang-Hua Teng (Commun. ACM, 2009)

A Note on Preconditioning by Low-Stretch Spanning Trees - Daniel A. Spielman; Jaeoh Woo (CoRR, 2009)

The Minimum Distance of Turbo-Like Codes. - Louay Bazzi; Mohammad Mahdian; Daniel A. Spielman (IEEE Trans. Inf. Theory, 2009)

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 (STOC, 2011)

Smoothed analysis of condition numbers and complexity implications for linear programming. - John Dunagan; Daniel A. Spielman; Shang-Hua Teng (Math. Program., 2011)

Graph Sparsification by Effective Resistances. - Daniel A. Spielman; Nikhil Srivastava (SIAM J. Comput., 2011)

Spectral Sparsification of Graphs. - Daniel A. Spielman; Shang-Hua Teng (SIAM J. Comput., 2011)

Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations. - Daniel A. Spielman (ICALP (2), 2012)

Exact Recovery of Sparsely-Used Dictionaries. - Daniel A. Spielman; Huan Wang; John Wright 001 (COLT, 2012)

Twice-Ramanujan Sparsifiers. - Joshua D. Batson; Daniel A. Spielman; Nikhil Srivastava (SIAM J. Comput., 2012)

Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees. - Adam Marcus 001; Daniel A. Spielman; Nikhil Srivastava (FOCS, 2013)

Exact Recovery of Sparse-Used Dictionaries. - Huan Wang; Daniel A. Spielman; John Wright 001 (IJCAI, 2013)

Spectral sparsification of graphs: theory and algorithms. - Joshua D. Batson; Daniel A. Spielman; Nikhil Srivastava; Shang-Hua Teng (Commun. ACM, 2013)

Special Section on the Fiftieth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009). - Maria-Florina Balcan; Mark Braverman; Daniel A. Spielman (SIAM J. Comput., 2013)

A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning. - Daniel A. Spielman; Shang-Hua Teng (SIAM J. Comput., 2013)

A Cheeger Inequality for the Graph Connection Laplacian. - Afonso S. Bandeira; Amit Singer; Daniel A. Spielman (SIAM J. Matrix Anal. Appl., 2013)

An efficient parallel solver for SDD linear systems. - Richard Peng; Daniel A. Spielman (STOC, 2014)

Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. - Daniel A. Spielman; Shang-Hua Teng (SIAM J. Matrix Anal. Appl., 2014)

Algorithms for Lipschitz Learning on Graphs. - Rasmus Kyng; Anup Rao 002; Sushant Sachdeva; Daniel A. Spielman (COLT, 2015)

Sparsified Cholesky Solvers for SDD linear systems. - Yin Tat Lee; Richard Peng; Daniel A. Spielman (CoRR, 2015)

A Batchwise Monotone Algorithm for Dictionary Learning. - Huan Wang; John Wright 001; Daniel A. Spielman (CoRR, 2015)

Sparsified Cholesky and multigrid solvers for connection laplacians. - Rasmus Kyng; Yin Tat Lee; Richard Peng; Sushant Sachdeva; Daniel A. Spielman (STOC, 2016)

Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. - Adam W. Marcus; Daniel A. Spielman; Nikhil Srivastava (SIAM J. Comput., 2018)

Balancing covariates in randomized experiments using the Gram-Schmidt walk. - Christopher Harshaw; Fredrik Sävje; Daniel A. Spielman; Peng Zhang (CoRR, 2019)

Hardness Results for Weaver's Discrepancy Problem. - Daniel A. Spielman; Peng Zhang (APPROX/RANDOM, 2022)

Robust and Practical Solution of Laplacian Equations by Approximate Elimination. - Yuan Gao 025; Rasmus Kyng; Daniel A. Spielman (CoRR, 2023)

Inference of rankings planted in random tournaments. - Dmitriy Kunisky; Daniel A. Spielman; Xifan Yu (CoRR, 2024)

Solve for x: Technical Perspective. - Daniel A. Spielman (Commun. ACM, 2024)

Statistical Inference of a Ranked Community in a Directed Graph. - Dmitriy Kunisky; Daniel A. Spielman; Alexander S. Wein; Xifan Yu (STOC, 2025)