Daniel A. Spielman

108 papers A* 31A 2B 5Misc 1Journal 60Unranked 9

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