Követés
Daniel Spielman
Daniel Spielman
Professor of Computer Science, Yale University
E-mail megerősítve itt: yale.edu - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Efficient erasure correcting codes
MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman
IEEE Transactions on Information Theory 47 (2), 569-584, 2001
14382001
Expander codes
M Sipser, DA Spielman
IEEE transactions on Information Theory 42 (6), 1710-1722, 1996
13591996
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
12892001
Practical loss-resilient codes
MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman, V Stemann
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
12031997
Graph sparsification by effective resistances
DA Spielman, N Srivastava
Proceedings of the fortieth annual ACM symposium on Theory of computing, 563-568, 2008
11812008
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
1137*2003
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
DA Spielman, SH Teng
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
11032004
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
10712004
Spectral partitioning works: Planar graphs and finite element meshes
DA Spielman, SH Teng
Linear Algebra and its Applications 421 (2-3), 284-305, 2007
818*2007
Spectral sparsification of graphs
DA Spielman, SH Teng
SIAM Journal on Computing 40 (4), 981-1025, 2011
6362011
Linear-time encodable and decodable error-correcting codes
DA Spielman
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
5771995
Interlacing families ii: Mixed characteristic polynomials and the kadison—singer problem
AW Marcus, DA Spielman, N Srivastava
Annals of Mathematics, 327-350, 2015
5422015
Twice-ramanujan sparsifiers
JD Batson, DA Spielman, N Srivastava
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
5252009
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
5021998
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
4922013
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
4652014
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
4342011
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
4232013
Spectral graph theory and its applications
DA Spielman
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 29-38, 2007
4122007
Spectral graph theory
D Spielman
Combinatorial scientific computing 18 (18), 2012
3912012
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20