| 2009 |
|---|
| 66 | EE | Daniel A. Spielman,
Jaeoh Woo:
A Note on Preconditioning by Low-Stretch Spanning Trees
CoRR abs/0903.2816: (2009) |
| 65 | EE | Daniel A. Spielman:
Technical perspective - The beauty of error-correcting codes.
Commun. ACM 52(3): 86 (2009) |
| 64 | EE | Louay Bazzi,
Mohammad Mahdian,
Daniel A. Spielman:
The Minimum Distance of Turbo-Like Codes.
IEEE Transactions on Information Theory 55(1): 6-15 (2009) |
| 2008 |
|---|
| 63 | EE | Samuel I. Daitch,
Daniel A. Spielman:
Faster approximate lossy generalized flow via interior point algorithms.
STOC 2008: 451-460 |
| 62 | EE | Daniel A. Spielman,
Nikhil Srivastava:
Graph sparsification by effective resistances.
STOC 2008: 563-568 |
| 61 | EE | Daniel A. Spielman,
Nikhil Srivastava:
Graph Sparsification by Effective Resistances
CoRR abs/0803.0929: (2008) |
| 60 | EE | Samuel I. Daitch,
Daniel A. Spielman:
Faster Approximate Lossy Generalized Flow via Interior Point Algorithms
CoRR abs/0803.0988: (2008) |
| 59 | EE | Joshua Batson,
Daniel A. Spielman,
Nikhil Srivastava:
Twice-Ramanujan Sparsifiers
CoRR abs/0808.0163: (2008) |
| 58 | EE | Daniel A. Spielman,
Shang-Hua Teng:
Spectral Sparsification of Graphs
CoRR abs/0808.4134: (2008) |
| 57 | EE | Daniel A. Spielman,
Shang-Hua Teng:
A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning
CoRR abs/0809.3232: (2008) |
| 56 | EE | Michael Elkin,
Yuval Emek,
Daniel A. Spielman,
Shang-Hua Teng:
Lower-Stretch Spanning Trees.
SIAM J. Comput. 38(2): 608-628 (2008) |
| 2007 |
|---|
| 55 | EE | Daniel A. Spielman:
Spectral Graph Theory and its Applications.
FOCS 2007: 29-38 |
| 54 | EE | Samuel I. Daitch,
Daniel A. Spielman:
Support-Graph Preconditioners for 2-Dimensional Trusses
CoRR abs/cs/0703119: (2007) |
| 53 | EE | Daniel A. Spielman,
Shang-Hua Teng,
Alper Üngör:
Parallel Delaunay Refinement: Algorithms and Analyses.
Int. J. Comput. Geometry Appl. 17(1): 1-30 (2007) |
| 2006 |
|---|
| 52 | EE | Jonathan A. Kelner,
Daniel A. Spielman:
A randomized polynomial-time simplex algorithm for linear programming.
STOC 2006: 51-60 |
| 51 | EE | Daniel A. Spielman,
Shang-Hua Teng:
Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
CoRR abs/cs/0607105: (2006) |
| 2005 |
|---|
| 50 | EE | Daniel A. Spielman:
The Smoothed Analysis of Algorithms.
FCT 2005: 17-18 |
| 49 | EE | Amit Deshpande,
Daniel A. Spielman:
Improved Smoothed Analysis of the Shadow Vertex Simplex Method.
FOCS 2005: 349-356 |
| 48 | EE | Michael Elkin,
Yuval Emek,
Daniel A. Spielman,
Shang-Hua Teng:
Lower-stretch spanning trees.
STOC 2005: 494-503 |
| 47 | EE | Jonathan A. Kelner,
Daniel A. Spielman:
A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version)
Electronic Colloquium on Computational Complexity (ECCC)(156): (2005) |
| 2004 |
|---|
| 46 | EE | Daniel A. Spielman,
Shang-Hua Teng,
Alper Üngör:
Parallel Delaunay Refinement with Off-Centers.
Euro-Par 2004: 812-819 |
| 45 | EE | Daniel A. Spielman,
Shang-Hua Teng,
Alper Üngör:
Time complexity of practical parallel steiner point insertion algorithms.
SPAA 2004: 267-268 |
| 44 | EE | Daniel A. Spielman,
Shang-Hua Teng:
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems.
STOC 2004: 81-90 |
| 43 | EE | Michael Elkin,
Daniel A. Spielman,
Shang-Hua Teng:
Lower-Stretch Spanning Trees
CoRR cs.DS/0411064: (2004) |
| 42 | EE | Daniel A. Spielman,
Shang-Hua Teng:
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time.
J. ACM 51(3): 385-463 (2004) |
| 2003 |
|---|
| 41 | EE | Daniel A. Spielman,
Shang-Hua Teng:
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31).
FOCS 2003: 416-427 |
| 40 | EE | Andrew M. Childs,
Richard Cleve,
Enrico Deotto,
Edward Farhi,
Sam Gutmann,
Daniel A. Spielman:
Exponential algorithmic speedup by a quantum walk.
STOC 2003: 59-68 |
| 39 | EE | Daniel A. Spielman,
Shang-Hua Teng:
Smoothed Analysis (Motivation and Discrete Models).
WADS 2003: 256-270 |
| 38 | EE | Daniel A. Spielman,
Shang-Hua Teng:
Smoothed Analysis of Interior-Point Algorithms: Termination
CoRR cs.DS/0301019: (2003) |
| 37 | EE | John Dunagan,
Daniel A. Spielman,
Shang-Hua Teng:
Smoothed Analysis of Interior-Point Algorithms: Condition Number
CoRR cs.DS/0302011: (2003) |
| 36 | EE | Daniel A. Spielman,
Shang-Hua Teng:
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31)
CoRR cs.DS/0310036: (2003) |
| 35 | EE | Daniel A. Spielman,
Shang-Hua Teng:
Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems
CoRR cs.DS/0310051: (2003) |
| 34 | EE | Arvind Sankar,
Daniel A. Spielman,
Shang-Hua Teng:
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
CoRR cs.NA/0310022: (2003) |
| 2002 |
|---|
| 33 | EE | Daniel A. Spielman,
Shang-Hua Teng,
Alper Üngör:
Parallel Delaunay Refinement: Algorithms And Analyses.
IMR 2002: 205-217 |
| 32 | EE | Daniel A. Spielman,
Shang-Hua Teng,
Alper Üngör:
Parallel Delaunay Refinement: Algorithms and Analyses
CoRR cs.CG/0207063: (2002) |
| 2001 |
|---|
| 31 | EE | Adam Klivans,
Daniel A. Spielman:
Randomness efficient identity testing of multivariate polynomials.
STOC 2001: 216-223 |
| 30 | EE | Daniel A. Spielman,
Shang-Hua Teng:
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time.
STOC 2001: 296-305 |
| 29 | EE | Daniel A. Spielman,
Shang-Hua Teng:
Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time
CoRR cs.DS/0111050: (2001) |
| 28 | | 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 47(2): 493-497 (2001) |
| 27 | | Michael Luby,
Michael Mitzenmacher,
Mohammad Amin Shokrollahi,
Daniel A. Spielman:
Efficient erasure correcting codes.
IEEE Transactions on Information Theory 47(2): 569-584 (2001) |
| 26 | | Michael Luby,
Michael Mitzenmacher,
Mohammad Amin Shokrollahi,
Daniel A. Spielman:
Improved low-density parity-check codes using irregular graphs.
IEEE Transactions on Information Theory 47(2): 585-598 (2001) |
| 25 | EE | Marcos A. Kiwi,
Daniel A. Spielman,
Shang-Hua Teng:
Min-max-boundary domain decomposition.
Theor. Comput. Sci. 261(2): 253-266 (2001) |
| 2000 |
|---|
| 24 | EE | Marcos A. Kiwi,
Carsten Lund,
Daniel A. Spielman,
Alexander Russell,
Ravi Sundaram:
Alternation in interaction.
Computational Complexity 9(3-4): 202-246 (2000) |
| 23 | EE | Daniel A. Spielman,
Miklós Bóna:
An Infinite Antichain of Permutations.
Electr. J. Comb. 7: (2000) |
| 1998 |
|---|
| 22 | EE | Marcos A. Kiwi,
Daniel A. Spielman,
Shang-Hua Teng:
Min-Max-Boundary Domain Decomposition.
COCOON 1998: 137-146 |
| 21 | EE | Daniel A. Spielman:
Models of Computation in Coding Theory.
IEEE Conference on Computational Complexity 1998: 120- |
| 20 | EE | Michael Luby,
Michael Mitzenmacher,
Mohammad Amin Shokrollahi,
Daniel A. Spielman:
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs.
STOC 1998: 249-258 |
| 1997 |
|---|
| 19 | | Daniel A. Spielman:
The Complexity of Error-Correcting Codes.
FCT 1997: 67-84 |
| 18 | EE | Michael Luby,
Michael Mitzenmacher,
Mohammad Amin Shokrollahi,
Daniel A. Spielman,
Volker Stemann:
Practical Loss-Resilient Codes.
STOC 1997: 150-159 |
| 17 | EE | Mohammad Amin Shokrollahi,
Daniel A. Spielman,
Volker Stemann:
A Remark on Matrix Rigidity.
Inf. Process. Lett. 64(6): 283-285 (1997) |
| 1996 |
|---|
| 16 | | Daniel A. Spielman:
Highly Fault-Tolerant Parallel Computation (extended abstract).
FOCS 1996: 154-163 |
| 15 | | Daniel A. Spielman,
Shang-Hua Teng:
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes.
FOCS 1996: 96-105 |
| 14 | EE | Daniel A. Spielman:
Faster Isomorphism Testing of Strongly Regular Graphs.
STOC 1996: 576-584 |
| 13 | EE | Daniel A. Spielman,
Shang-Hua Teng:
Disk Packings and Planar Separators.
Symposium on Computational Geometry 1996: 349-358 |
| 12 | | Michael Sipser,
Daniel A. Spielman:
Expander codes.
IEEE Transactions on Information Theory 42(6): 1710-1722 (1996) |
| 11 | | Daniel A. Spielman:
Linear-time encodable and decodable error-correcting codes.
IEEE Transactions on Information Theory 42(6): 1723-1731 (1996) |
| 1995 |
|---|
| 10 | EE | Daniel A. Spielman:
Linear-time encodable and decodable error-correcting codes.
STOC 1995: 388-397 |
| 9 | | Richard Beigel,
Nick Reingold,
Daniel A. Spielman:
PP Is Closed under Intersection.
J. Comput. Syst. Sci. 50(2): 191-202 (1995) |
| 1994 |
|---|
| 8 | | Michael Sipser,
Daniel A. Spielman:
Expander Codes
FOCS 1994: 566-576 |
| 7 | EE | Alexander Polishchuk,
Daniel A. Spielman:
Nearly-linear size holographic proofs.
STOC 1994: 194-203 |
| 6 | | Marcos A. Kiwi,
Carsten Lund,
Alexander Russell,
Daniel A. Spielman,
Ravi Sundaram:
Alternation in Interaction.
Structure in Complexity Theory Conference 1994: 294-303 |
| 5 | | Joan Feigenbaum,
Lance Fortnow,
Carsten Lund,
Daniel A. Spielman:
The Power of Adaptiveness and Additional Queries in Random-Self-Reductions.
Computational Complexity 4: 158-174 (1994) |
| 1993 |
|---|
| 4 | EE | Richard Beigel,
Grigorii Margulis,
Daniel A. Spielman:
Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds.
SPAA 1993: 21-29 |
| 1992 |
|---|
| 3 | | 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: 338-346 |
| 1991 |
|---|
| 2 | | Richard Beigel,
Nick Reingold,
Daniel A. Spielman:
PP Is Closed Under Intersection (Extended Abstract)
STOC 1991: 1-9 |
| 1 | | Richard Beigel,
Nick Reingold,
Daniel A. Spielman:
The Perceptron Strikes Back.
Structure in Complexity Theory Conference 1991: 286-291 |
