Daniel A. Spielman

ORCID

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 7

Top Venues

CoRR

STOC

APPROX/RANDOM

SIAM J. Matrix Anal. Appl.

Publications

Dmitriy Kunisky, Daniel A. Spielman, Xifan Yu
Inference of rankings planted in random tournaments. CoRR (2024)
Yuan Gao, Rasmus Kyng, Daniel A. Spielman
Robust and Practical Solution of Laplacian Equations by Approximate Elimination. CoRR (2023)
Daniel A. Spielman, Peng Zhang
Hardness Results for Weaver's Discrepancy Problem. CoRR (2022)
Daniel A. Spielman, Peng Zhang
Hardness Results for Weaver's Discrepancy Problem. APPROX/RANDOM (2022)
Christopher Harshaw, Fredrik Sävje, Daniel A. Spielman, Peng Zhang
Balancing covariates in randomized experiments using the Gram-Schmidt walk. CoRR (2019)
Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. SIAM J. Comput. 47 (6) (2018)
Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman
Sparsified Cholesky and multigrid solvers for connection laplacians. STOC (2016)
Huan Wang, John Wright, Daniel A. Spielman
A Batchwise Monotone Algorithm for Dictionary Learning. CoRR (2015)
Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. FOCS (2015)
Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman
Sparsified Cholesky and Multigrid Solvers for Connection Laplacians. CoRR (2015)
Yin Tat Lee, Richard Peng, Daniel A. Spielman
Sparsified Cholesky Solvers for SDD linear systems. CoRR (2015)
Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman
Algorithms for Lipschitz Learning on Graphs. CoRR (2015)
Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman
Algorithms for Lipschitz Learning on Graphs. COLT (2015)
Daniel A. Spielman, Shang-Hua Teng
Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. SIAM J. Matrix Anal. Appl. 35 (3) (2014)
Richard Peng, Daniel A. Spielman
An efficient parallel solver for SDD linear systems. STOC (2014)
Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava
Twice-Ramanujan Sparsifiers. SIAM Rev. 56 (2) (2014)
Huan Wang, Daniel A. Spielman, John Wright
Exact Recovery of Sparse-Used Dictionaries. IJCAI (2013)
Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava, Shang-Hua Teng
Spectral sparsification of graphs: theory and algorithms. Commun. ACM 56 (8) (2013)
Adam Marcus, Daniel A. Spielman, Nikhil Srivastava
Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees. FOCS (2013)
Daniel A. Spielman, Shang-Hua Teng
A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning. SIAM J. Comput. 42 (1) (2013)
Maria-Florina Balcan, Mark Braverman, Daniel A. Spielman
Special Section on the Fiftieth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009). SIAM J. Comput. 42 (6) (2013)
Afonso S. Bandeira, Amit Singer, Daniel A. Spielman
A Cheeger Inequality for the Graph Connection Laplacian. SIAM J. Matrix Anal. Appl. 34 (4) (2013)
Richard Peng, Daniel A. Spielman
An Efficient Parallel Solver for SDD Linear Systems. CoRR (2013)
Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava
Twice-Ramanujan Sparsifiers. SIAM J. Comput. 41 (6) (2012)
Daniel A. Spielman, Huan Wang, John Wright
Exact Recovery of Sparsely-Used Dictionaries CoRR (2012)
Daniel A. Spielman
Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations. ICALP (2) (2012)
Daniel A. Spielman, Huan Wang, John Wright
Exact Recovery of Sparsely-Used Dictionaries. COLT (2012)
Afonso S. Bandeira, Amit Singer, Daniel A. Spielman
A Cheeger Inequality for the Graph Connection Laplacian CoRR (2012)
Paul F. Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. STOC (2011)
Daniel A. Spielman, Shang-Hua Teng
Spectral Sparsification of Graphs. SIAM J. Comput. 40 (4) (2011)
Daniel A. Spielman, Nikhil Srivastava
Graph Sparsification by Effective Resistances. SIAM J. Comput. 40 (6) (2011)
John Dunagan, Daniel A. Spielman, Shang-Hua Teng
Smoothed analysis of condition numbers and complexity implications for linear programming. Math. Program. 126 (2) (2011)
Paul F. Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs CoRR (2010)
Daniel A. Spielman, Shang-Hua Teng
Smoothed analysis: an attempt to explain the behavior of algorithms in practice. Commun. ACM 52 (10) (2009)
Samuel I. Daitch, Jonathan A. Kelner, Daniel A. Spielman
Fitting a graph to vector data. ICML (2009)
Samuel I. Daitch, Daniel A. Spielman
A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix. Combinatorial Scientific Computing (2009)
Louay Bazzi, Mohammad Mahdian, Daniel A. Spielman
The Minimum Distance of Turbo-Like Codes. IEEE Trans. Inf. Theory 55 (1) (2009)
Daniel A. Spielman
Technical perspective - The beauty of error-correcting codes. Commun. ACM 52 (3) (2009)
Daniel A. Spielman, Jaeoh Woo
A Note on Preconditioning by Low-Stretch Spanning Trees CoRR (2009)
Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava
Twice-ramanujan sparsifiers. STOC (2009)
Daniel A. Spielman, Nikhil Srivastava
Graph Sparsification by Effective Resistances CoRR (2008)
Daniel A. Spielman, Shang-Hua Teng
A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning CoRR (2008)
Samuel I. Daitch, Daniel A. Spielman
Faster Approximate Lossy Generalized Flow via Interior Point Algorithms CoRR (2008)
Daniel A. Spielman, Nikhil Srivastava
Graph sparsification by effective resistances. STOC (2008)
Daniel A. Spielman, Shang-Hua Teng
Spectral Sparsification of Graphs CoRR (2008)
Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng
Lower-Stretch Spanning Trees. SIAM J. Comput. 38 (2) (2008)
Samuel I. Daitch, Daniel A. Spielman
Faster approximate lossy generalized flow via interior point algorithms. STOC (2008)
Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava
Twice-Ramanujan Sparsifiers CoRR (2008)
Daniel A. Spielman
Spectral Graph Theory and its Applications. FOCS (2007)
Samuel I. Daitch, Daniel A. Spielman
Support-Graph Preconditioners for 2-Dimensional Trusses CoRR (2007)
Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
Parallel Delaunay Refinement: Algorithms and Analyses. Int. J. Comput. Geom. Appl. 17 (1) (2007)
Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices. SIAM J. Matrix Anal. Appl. 28 (2) (2006)
Daniel A. Spielman, Shang-Hua Teng
Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems CoRR (2006)
Jonathan A. Kelner, Daniel A. Spielman
A randomized polynomial-time simplex algorithm for linear programming. STOC (2006)
Daniel A. Spielman
The Smoothed Analysis of Algorithms. FCT (2005)
Ming Cao, Daniel A. Spielman, A. Stephen Morse
A Lower Bound on Convergence of a Distributed Network Consensus Algorithm. CDC/ECC (2005)
Amit Deshpande, Daniel A. Spielman
Improved Smoothed Analysis of the Shadow Vertex Simplex Method. FOCS (2005)
Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng
Lower-stretch spanning trees. STOC (2005)
Jonathan A. Kelner, Daniel A. Spielman
A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version) Electron. Colloquium Comput. Complex. (156) (2005)
Daniel A. Spielman, Shang-Hua Teng
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. STOC (2004)
Daniel A. Spielman, Shang-Hua Teng
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51 (3) (2004)
Michael Elkin, Daniel A. Spielman, Shang-Hua Teng
Lower-Stretch Spanning Trees CoRR (2004)
Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
Time complexity of practical parallel steiner point insertion algorithms. SPAA (2004)
Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
Parallel Delaunay Refinement with Off-Centers. Euro-Par (2004)
Daniel A. Spielman, Shang-Hua Teng
Smoothed analysis of termination of linear programming algorithms. Math. Program. 97 (1-2) (2003)
Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman
Exponential algorithmic speedup by a quantum walk. STOC (2003)
Daniel A. Spielman, Shang-Hua Teng
). FOCS (2003)
John Dunagan, Daniel A. Spielman, Shang-Hua Teng
Smoothed Analysis of Interior-Point Algorithms: Condition Number CoRR (2003)
Daniel A. Spielman, Shang-Hua Teng
Smoothed Analysis (Motivation and Discrete Models). WADS (2003)
Daniel A. Spielman, Shang-Hua Teng
) CoRR (2003)
Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices CoRR (2003)
Daniel A. Spielman, Shang-Hua Teng
Smoothed Analysis of Interior-Point Algorithms: Termination CoRR (2003)
Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
Parallel Delaunay Refinement: Algorithms And Analyses. IMR (2002)
Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
Parallel Delaunay Refinement: Algorithms and Analyses CoRR (2002)
Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
Improved low-density parity-check codes using irregular graphs. IEEE Trans. Inf. Theory 47 (2) (2001)
Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
Efficient erasure correcting codes. IEEE Trans. Inf. Theory 47 (2) (2001)
Daniel A. Spielman, Shang-Hua Teng
Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time CoRR (2001)
Adam R. Klivans, Daniel A. Spielman
Randomness efficient identity testing of multivariate polynomials. STOC (2001)
Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng
Min-max-boundary domain decomposition. Theor. Comput. Sci. 261 (2) (2001)
Brendan J. Frey, Ralf Koetter, G. David Forney Jr., Frank R. Kschischang, Robert J. McEliece, Daniel A. Spielman
Introduction to the special issue on codes on graphs and iterative algorithms. IEEE Trans. Inf. Theory 47 (2) (2001)
Daniel A. Spielman, Shang-Hua Teng
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. STOC (2001)
Marcos A. Kiwi, Carsten Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram
Alternation in interaction. Comput. Complex. 9 (3-4) (2000)
Daniel A. Spielman, Miklós Bóna
An Infinite Antichain of Permutations. Electron. J. Comb. 7 (2000)
Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. STOC (1998)
Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng
Min-Max-Boundary Domain Decomposition. COCOON (1998)
Daniel A. Spielman
Models of Computation in Coding Theory. Computational Complexity Conference (1998)
Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann
A Remark on Matrix Rigidity. Inf. Process. Lett. 64 (6) (1997)
Daniel A. Spielman
The Complexity of Error-Correcting Codes. FCT (1997)
Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann
Practical Loss-Resilient Codes. STOC (1997)
Michael Sipser, Daniel A. Spielman
Expander codes. IEEE Trans. Inf. Theory 42 (6) (1996)
Daniel A. Spielman
Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inf. Theory 42 (6) (1996)
Daniel A. Spielman, Shang-Hua Teng
Disk Packings and Planar Separators. SCG (1996)
Daniel A. Spielman, Shang-Hua Teng
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. FOCS (1996)
Daniel A. Spielman
Highly Fault-Tolerant Parallel Computation (extended abstract). FOCS (1996)
Daniel A. Spielman
Faster Isomorphism Testing of Strongly Regular Graphs. STOC (1996)
Daniel A. Spielman
Linear-time encodable and decodable error-correcting codes. STOC (1995)
Richard Beigel, Nick Reingold, Daniel A. Spielman
PP Is Closed under Intersection. J. Comput. Syst. Sci. 50 (2) (1995)
Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman
The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. Comput. Complex. 4 (1994)
Alexander Polishchuk, Daniel A. Spielman
Nearly-linear size holographic proofs. STOC (1994)
Michael Sipser, Daniel A. Spielman
Expander Codes FOCS (1994)

Daniel A. Spielman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniel A. Spielman