| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Afonso S. Bandeira, Amit Singer, Daniel A. Spielman |
A Cheeger Inequality for the Graph Connection Laplacian  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | John Dunagan, Daniel A. Spielman, Shang-Hua Teng |
Smoothed analysis of condition numbers and complexity implications for linear programming. |
Math. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman, Nikhil Srivastava |
Graph Sparsification by Effective Resistances. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Spectral Sparsification of Graphs. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul 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 |
DBLP BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Smoothed analysis: an attempt to explain the behavior of algorithms in practice. |
Commun. ACM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman |
Technical perspective - The beauty of error-correcting codes. |
Commun. ACM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman, Jaeoh Woo |
A Note on Preconditioning by Low-Stretch Spanning Trees |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Louay Bazzi, Mohammad Mahdian, Daniel A. Spielman |
The Minimum Distance of Turbo-Like Codes. |
IEEE Transactions on Information Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel I. Daitch, Jonathan A. Kelner, Daniel A. Spielman |
Fitting a graph to vector data. |
ICML |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava |
Twice-ramanujan sparsifiers. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
expander graphs, spectral graph theory |
| 1 | Samuel I. Daitch, Daniel A. Spielman |
Faster Approximate Lossy Generalized Flow via Interior Point Algorithms |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Spectral Sparsification of Graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Daniel A. Spielman, Nikhil Srivastava |
Graph Sparsification by Effective Resistances |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava |
Twice-Ramanujan Sparsifiers |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng |
Lower-Stretch Spanning Trees. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel I. Daitch, Daniel A. Spielman |
Faster approximate lossy generalized flow via interior point algorithms. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, linear programming, network flows, interior-point algorithms |
| 1 | Daniel A. Spielman, Nikhil Srivastava |
Graph sparsification by effective resistances. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
electrical flows, random sampling, spectral graph theory |
| 1 | Samuel I. Daitch, Daniel A. Spielman |
Support-Graph Preconditioners for 2-Dimensional Trusses |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng, Alper Üngör |
Parallel Delaunay Refinement: Algorithms and Analyses. |
Int. J. Comput. Geometry Appl. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman |
Spectral Graph Theory and its Applications. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng |
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices. |
SIAM J. Matrix Analysis Applications |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Daniel A. Spielman |
A randomized polynomial-time simplex algorithm for linear programming. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Daniel A. Spielman |
A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version) |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Daniel A. Spielman |
The Smoothed Analysis of Algorithms. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Deshpande, Daniel A. Spielman |
Improved Smoothed Analysis of the Shadow Vertex Simplex Method. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng |
Lower-stretch spanning trees. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
low-distortion embeddings, low-stretch spanning trees, probabilistic tree metrics |
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
complexity, perturbation, Simplex method, smoothed analysis |
| 1 | Michael Elkin, Daniel A. Spielman, Shang-Hua Teng |
Lower-Stretch Spanning Trees |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng, Alper Üngör |
Parallel Delaunay Refinement with Off-Centers. |
Euro-Par |
2004 |
DBLP DOI BibTeX RDF |
parallel algorithms, triangulations, Delaunay refinement |
| 1 | Daniel A. Spielman, Shang-Hua Teng, Alper Üngör |
Time complexity of practical parallel steiner point insertion algorithms. |
SPAA |
2004 |
DBLP DOI BibTeX RDF |
parallelization, delaunay triangulations, Steiner points |
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
graph sparsification, graph partitioning, preconditioners |
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31) |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | John Dunagan, Daniel A. Spielman, Shang-Hua Teng |
Smoothed Analysis of Interior-Point Algorithms: Condition Number |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng |
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Smoothed Analysis of Interior-Point Algorithms: Termination |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Smoothed analysis of termination of linear programming algorithms. |
Math. Program. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Smoothed Analysis (Motivation and Discrete Models). |
WADS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31). |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman |
Exponential algorithmic speedup by a quantum walk. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
quantum algorithms, quantum walks |
| 1 | Daniel A. Spielman, Shang-Hua Teng, Alper Üngör |
Parallel Delaunay Refinement: Algorithms and Analyses |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng, Alper Üngör |
Parallel Delaunay Refinement: Algorithms And Analyses. |
IMR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng |
Min-max-boundary domain decomposition. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman |
Efficient erasure correcting codes. |
IEEE Transactions on Information Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 Transactions on Information Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman |
Improved low-density parity-check codes using irregular graphs. |
IEEE Transactions on Information Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Klivans, Daniel A. Spielman |
Randomness efficient identity testing of multivariate polynomials. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman, Miklós Bóna |
An Infinite Antichain of Permutations. |
Electr. J. Comb. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Marcos A. Kiwi, Carsten Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram |
Alternation in interaction. |
Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng |
Min-Max-Boundary Domain Decomposition. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman |
Models of Computation in Coding Theory. (PDF / PS) |
IEEE Conference on Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman |
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. |
STOC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann |
A Remark on Matrix Rigidity. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman |
The Complexity of Error-Correcting Codes. |
FCT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann |
Practical Loss-Resilient Codes. |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman |
Linear-time encodable and decodable error-correcting codes. |
IEEE Transactions on Information Theory |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Sipser, Daniel A. Spielman |
Expander codes. |
IEEE Transactions on Information Theory |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Disk Packings and Planar Separators. |
Symposium on Computational Geometry |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
bounded-degree planar graphs, planar graphs, finite element analysis, numerical algorithms, spectral partitioning, finite element meshes |
| 1 | Daniel A. Spielman |
Highly Fault-Tolerant Parallel Computation (extended abstract). |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
fault-tolerant parallel computation, coded model, generalized Reed-Solomon codes, coded computation, parallel computation, fault tolerant computing, fault-tolerant computation, error-correcting code, failure probability |
| 1 | Daniel A. Spielman |
Faster Isomorphism Testing of Strongly Regular Graphs. |
STOC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Beigel, Nick Reingold, Daniel A. Spielman |
PP Is Closed under Intersection. |
J. Comput. Syst. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman |
Linear-time encodable and decodable error-correcting codes. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman |
The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. |
Computational Complexity |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Sipser, Daniel A. Spielman |
Expander Codes |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
logarithmic time parallel decoding algorithms, expander codes, linear error-correcting codes, linear time sequential decoding algorithms, expander graphs |
| 1 | Marcos A. Kiwi, Carsten Lund, Alexander Russell, Daniel A. Spielman, Ravi Sundaram |
Alternation in Interaction. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
| 1 | Alexander Polishchuk, Daniel A. Spielman |
Nearly-linear size holographic proofs. |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Beigel, Grigorii Margulis, Daniel A. Spielman |
Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds. |
SPAA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman |
The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. |
Structure in Complexity Theory Conference |
1992 |
DBLP BibTeX RDF |
|
| 1 | Richard Beigel, Nick Reingold, Daniel A. Spielman |
The Perceptron Strikes Back. |
Structure in Complexity Theory Conference |
1991 |
DBLP BibTeX RDF |
|
| 1 | Richard Beigel, Nick Reingold, Daniel A. Spielman |
PP Is Closed Under Intersection (Extended Abstract) |
STOC |
1991 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")