| Efficient erasure correcting codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on Information Theory 47 (2), 569-584, 2001 | 1292 | 2001 |
| 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 | 1170 | 2001 |
| 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 | 1118 | 1997 |
| Expander codes M Sipser, DA Spielman IEEE transactions on Information Theory 42 (6), 1710-1722, 1996 | 1105 | 1996 |
| 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 | 948 | 2004 |
| 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 | 823 | 2004 |
| 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 | 765* | 2003 |
| Graph sparsification by effective resistances DA Spielman, N Srivastava SIAM Journal on Computing 40 (6), 1913-1926, 2011 | 749 | 2011 |
| Spectral partitioning works: Planar graphs and finite element meshes DA Spielman, SH Teng Linear Algebra and its Applications 421 (2-3), 284-305, 2007 | 669* | 2007 |
| Linear-time encodable and decodable error-correcting codes DA Spielman IEEE Transactions on Information Theory 42 (6), 1723-1731, 1996 | 471 | 1996 |
| 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 | 449 | 1998 |
| Twice-ramanujan sparsifiers J Batson, DA Spielman, N Srivastava SIAM Journal on Computing 41 (6), 1704-1721, 2012 | 369 | 2012 |
| Spectral sparsification of graphs DA Spielman, SH Teng SIAM Journal on Computing 40 (4), 981-1025, 2011 | 354 | 2011 |
| Interlacing families II: Mixed characteristic polynomials and the Kadison—Singer problem AW Marcus, DA Spielman, N Srivastava Annals of Mathematics, 327-350, 2015 | 349 | 2015 |
| 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 | 315 | 2013 |
| 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 | 301 | 2011 |
| 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 | 300 | 2014 |
| 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 | 300 | 2014 |
| 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 | 281 | 2013 |
| Exact recovery of sparsely-used dictionaries DA Spielman, H Wang, J Wright Conference on Learning Theory, 37.1-37.18, 2012 | 248 | 2012 |
Amin ShokrollahiEPFLEmail verificata su epfl.ch
