Daniel A. Spielman

	2009
69		Samuel I. Daitch, Jonathan A. Kelner, Daniel A. Spielman: Fitting a graph to vector data. ICML 2009: 26
68		Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava: Twice-ramanujan sparsifiers. STOC 2009: 255-262
67		Daniel A. Spielman, Jaeoh Woo: A Note on Preconditioning by Low-Stretch Spanning Trees CoRR abs/0903.2816: (2009)
66		Daniel A. Spielman, Shang-Hua Teng: Smoothed analysis: an attempt to explain the behavior of algorithms in practice. Commun. ACM 52(10): 76-84 (2009)
65		Daniel A. Spielman: Technical perspective - The beauty of error-correcting codes. Commun. ACM 52(3): 86 (2009)
64		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		Samuel I. Daitch, Daniel A. Spielman: Faster approximate lossy generalized flow via interior point algorithms. STOC 2008: 451-460
62		Daniel A. Spielman, Nikhil Srivastava: Graph sparsification by effective resistances. STOC 2008: 563-568
61		Daniel A. Spielman, Nikhil Srivastava: Graph Sparsification by Effective Resistances CoRR abs/0803.0929: (2008)
60		Samuel I. Daitch, Daniel A. Spielman: Faster Approximate Lossy Generalized Flow via Interior Point Algorithms CoRR abs/0803.0988: (2008)
59		Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava: Twice-Ramanujan Sparsifiers CoRR abs/0808.0163: (2008)
58		Daniel A. Spielman, Shang-Hua Teng: Spectral Sparsification of Graphs CoRR abs/0808.4134: (2008)
57		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		Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng: Lower-Stretch Spanning Trees. SIAM J. Comput. 38(2): 608-628 (2008)
	2007
55		Daniel A. Spielman: Spectral Graph Theory and its Applications. FOCS 2007: 29-38
54		Samuel I. Daitch, Daniel A. Spielman: Support-Graph Preconditioners for 2-Dimensional Trusses CoRR abs/cs/0703119: (2007)
53		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		Jonathan A. Kelner, Daniel A. Spielman: A randomized polynomial-time simplex algorithm for linear programming. STOC 2006: 51-60
51		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		Daniel A. Spielman: The Smoothed Analysis of Algorithms. FCT 2005: 17-18
49		Amit Deshpande, Daniel A. Spielman: Improved Smoothed Analysis of the Shadow Vertex Simplex Method. FOCS 2005: 349-356
48		Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng: Lower-stretch spanning trees. STOC 2005: 494-503
47		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		Daniel A. Spielman, Shang-Hua Teng, Alper Üngör: Parallel Delaunay Refinement with Off-Centers. Euro-Par 2004: 812-819
45		Daniel A. Spielman, Shang-Hua Teng, Alper Üngör: Time complexity of practical parallel steiner point insertion algorithms. SPAA 2004: 267-268
44		Daniel A. Spielman, Shang-Hua Teng: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. STOC 2004: 81-90
43		Michael Elkin, Daniel A. Spielman, Shang-Hua Teng: Lower-Stretch Spanning Trees CoRR cs.DS/0411064: (2004)
42		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		Daniel A. Spielman, Shang-Hua Teng: Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31). FOCS 2003: 416-427
40		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		Daniel A. Spielman, Shang-Hua Teng: Smoothed Analysis (Motivation and Discrete Models). WADS 2003: 256-270
38		Daniel A. Spielman, Shang-Hua Teng: Smoothed Analysis of Interior-Point Algorithms: Termination CoRR cs.DS/0301019: (2003)
37		John Dunagan, Daniel A. Spielman, Shang-Hua Teng: Smoothed Analysis of Interior-Point Algorithms: Condition Number CoRR cs.DS/0302011: (2003)
36		Daniel A. Spielman, Shang-Hua Teng: Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31) CoRR cs.DS/0310036: (2003)
35		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		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		Daniel A. Spielman, Shang-Hua Teng, Alper Üngör: Parallel Delaunay Refinement: Algorithms And Analyses. IMR 2002: 205-217
32		Daniel A. Spielman, Shang-Hua Teng, Alper Üngör: Parallel Delaunay Refinement: Algorithms and Analyses CoRR cs.CG/0207063: (2002)
	2001
31		Adam Klivans, Daniel A. Spielman: Randomness efficient identity testing of multivariate polynomials. STOC 2001: 216-223
30		Daniel A. Spielman, Shang-Hua Teng: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. STOC 2001: 296-305
29		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		Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng: Min-max-boundary domain decomposition. Theor. Comput. Sci. 261(2): 253-266 (2001)
	2000
24		Marcos A. Kiwi, Carsten Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram: Alternation in interaction. Computational Complexity 9(3-4): 202-246 (2000)
23		Daniel A. Spielman, Miklós Bóna: An Infinite Antichain of Permutations. Electr. J. Comb. 7: (2000)
	1998
22		Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng: Min-Max-Boundary Domain Decomposition. COCOON 1998: 137-146
21		Daniel A. Spielman: Models of Computation in Coding Theory. IEEE Conference on Computational Complexity 1998: 120-
20		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		Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann: Practical Loss-Resilient Codes. STOC 1997: 150-159
17		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		Daniel A. Spielman: Faster Isomorphism Testing of Strongly Regular Graphs. STOC 1996: 576-584
13		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		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		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		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

Coauthor Index

1	Joshua D. Batson	[59] [68]
2	Louay Bazzi	[64]
3	Richard Beigel	[1] [2] [4] [9]
4	Miklós Bóna	[23]
5	Andrew M. Childs	[40]
6	Richard Cleve	[40]
7	Samuel I. Daitch	[54] [60] [63] [69]
8	Enrico Deotto	[40]
9	Amit Deshpande	[49]
10	John Dunagan	[37]
11	Michael Elkin	[43] [48] [56]
12	Yuval Emek	[48] [56]
13	Edward Farhi	[40]
14	Joan Feigenbaum	[3] [5]
15	G. David Forney Jr.	[28]
16	Lance Fortnow	[3] [5]
17	Brendan J. Frey	[28]
18	Sam Gutmann	[40]
19	Jonathan A. Kelner	[47] [52] [69]
20	Marcos A. Kiwi	[6] [22] [24] [25]
21	Adam R. Klivans (Adam Klivans)	[31]
22	Ralf Koetter (Ralf Kötter)	[28]
23	Frank R. Kschischang	[28]
24	Michael Luby	[18] [20] [26] [27]
25	Carsten Lund	[3] [5] [6] [24]
26	Mohammad Mahdian	[64]
27	Grigorii Margulis	[4]
28	Robert J. McEliece	[28]
29	Michael Mitzenmacher	[18] [20] [26] [27]
30	Alexander Polishchuk	[7]
31	Nick Reingold	[1] [2] [9]
32	Alexander Russell	[6] [24]
33	Arvind Sankar	[34]
34	Mohammad Amin Shokrollahi	[17] [18] [20] [26] [27]
35	Michael Sipser	[8] [12]
36	Nikhil Srivastava	[59] [61] [62] [68]
37	Volker Stemann	[17] [18]
38	Ravi Sundaram	[6] [24]
39	Shang-Hua Teng	[13] [15] [22] [25] [29] [30] [32] [33] [34] [35] [36] [37] [38] [39] [41] [42] [43] [44] [45] [46] [48] [51] [53] [56] [57] [58] [66]
40	Alper Üngör	[32] [33] [45] [46] [53]
41	Jaeoh Woo	[67]

Colors in the list of coauthors