Daniel Spielman
Daniel Spielman
Professor of Computer Science, Yale University
Verified email at yale.edu - Homepage
TitleCited byYear
Efficient erasure correcting codes
MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman
IEEE Transactions on Information Theory 47 (2), 569-584, 2001
12492001
Improved low-density parity-check codes using irregular graphs
MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman
IEEE Transactions on information Theory 47 (2), 585-598, 2001
11342001
Practical loss-resilient codes
M Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman, V Stemann
STOC 97, 150-159, 1997
10791997
Expander codes
M Sipser, DA Spielman
IEEE transactions on Information Theory 42 (6), 1710-1722, 1996
10411996
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
DA Spielman, SH Teng
Journal of the ACM (JACM) 51 (3), 385-463, 2004
8492004
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
DA Spielman, SH Teng
Proceedings of the STOC 4, 2004
7322004
Exponential algorithmic speedup by a quantum walk
AM Childs, R Cleve, E Deotto, E Farhi, S Gutmann, DA Spielman
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
694*2003
Graph sparsification by effective resistances
DA Spielman, N Srivastava
SIAM Journal on Computing 40 (6), 1913-1926, 2011
6242011
Spectral partitioning works: Planar graphs and finite element meshes
DA Spielman, SH Teng
Linear Algebra and its Applications 421 (2-3), 284-305, 2007
603*2007
Linear-time encodable and decodable error-correcting codes
DA Spielman
IEEE Transactions on Information Theory 42 (6), 1723-1731, 1996
4431996
Analysis of low density codes and improved designs using irregular graphs
M Luby, M Mitzenmacher, A Shokrollah, D Spielman
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
4391998
Twice-ramanujan sparsifiers
J Batson, DA Spielman, N Srivastava
SIAM Journal on Computing 41 (6), 1704-1721, 2012
3142012
Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
DA Spielman, SH Teng
SIAM Journal on Matrix Analysis and Applications 35 (3), 835-885, 2014
3052014
Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
DA Spielman, SH Teng
SIAM Journal on Matrix Analysis and Applications 35 (3), 835-885, 2014
3052014
Interlacing families II: Mixed characteristic polynomials and the Kadison—Singer problem
AW Marcus, DA Spielman, N Srivastava
Annals of Mathematics, 327-350, 2015
3042015
Spectral sparsification of graphs
DA Spielman, SH Teng
SIAM Journal on Computing 40 (4), 981-1025, 2011
2882011
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
P Christiano, JA Kelner, A Madry, DA Spielman, SH Teng
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
2662011
A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
DA Spielman, SH Teng
SIAM Journal on Computing 42 (1), 1-26, 2013
264*2013
Interlacing families I: Bipartite Ramanujan graphs of all degrees
A Marcus, DA Spielman, N Srivastava
2013 IEEE 54th Annual Symposium on Foundations of computer science, 529-537, 2013
2442013
PP is closed under intersection
R Beigel, N Reingold, D Spielman
Proceedings of the twenty-third annual ACM symposium on Theory of computing, 1-9, 1991
2211991
The system can't perform the operation now. Try again later.
Articles 1–20