Daniel Spielman

Cited by

	All	Since 2019
Citations	21906	7064
h-index	57	38
i10-index	91	60

1400

700

350

1050

199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202484 85 100 133 200 251 352 542 573 641 677 611 778 807 794 893 930 1091 1138 1225 1212 1210 1192 1218 1213 1216 1360 865

Public access

View all

6 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Amin ShokrollahiEPFLVerified email at epfl.ch
Nikhil SrivastavaUC BerkeleyVerified email at berkeley.edu
Michael MitzenmacherProfessor of Computer Science, Harvard UniversityVerified email at eecs.harvard.edu
Michael LubyBitRipple and ICSIVerified email at bitripple.com
Adam MarcusCo-Founder at Unlimited Labs/B12Verified email at marcua.net
Andrew M. ChildsJoint Center for Quantum Information and Computer Science, University of MarylandVerified email at umd.edu
Joshua BatsonMIT Mathematics PhDVerified email at mit.edu
Richard PengCarnegie Mellon UniversityVerified email at cs.cmu.edu
Rasmus KyngETH ZurichVerified email at kyng.dk
John WrightElectrical Engineering, Columbia UniversityVerified email at columbia.edu
Yuval EmekTechnion - Israel Institute of TechnologyVerified email at technion.ac.il
Michael ElkinBen-Gurion University of the Negev, IsraelVerified email at cs.bgu.ac.il
Sushant SachdevaUToronto, Associate Professor. Vector Institute AffiliateVerified email at cs.toronto.edu
Ming CaoFull Professor of Systems and Control, University of Groningen, the NetherlandsVerified email at rug.nl
Yin Tat LeePaul G. Allen School of Computer Science & Engineering, University of WashingtonVerified email at uw.edu
Aleksander MądryMITVerified email at mit.edu
Paul ChristianoNational Institute of Standards and TechnologyVerified email at nist.gov
Marcos KiwiUniversity of ChileVerified email at dim.uchile.cl
Mohammad MahdianResearch Scientist, GoogleVerified email at alum.mit.edu
Louay BazziAmerican University of BeirutVerified email at aub.edu.lb

Daniel Spielman

Professor of Computer Science, Yale University

Verified email at yale.edu - Homepage

Theoretical Computer Science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Efficient erasure correcting codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on Information Theory 47 (2), 569-584, 2001	1415	2001
Expander codes M Sipser, DA Spielman IEEE transactions on Information Theory 42 (6), 1710-1722, 1996	1297	1996
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	1288	2001
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	1248	2004
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	1193	1997
Graph sparsification by effective resistances DA Spielman, N Srivastava Proceedings of the fortieth annual ACM symposium on Theory of computing, 563-568, 2008	1121	2008
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	1082*	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	1081	2004
Spectral partitioning works: Planar graphs and finite element meshes DA Spielman, SH Teng Linear Algebra and its Applications 421 (2-3), 284-305, 2007	801*	2007
Spectral sparsification of graphs DA Spielman, SH Teng SIAM Journal on Computing 40 (4), 981-1025, 2011	592	2011
Linear-time encodable and decodable error-correcting codes DA Spielman Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995	553	1995
Interlacing families ii: Mixed characteristic polynomials and the kadison—singer problem AW Marcus, DA Spielman, N Srivastava Annals of Mathematics, 327-350, 2015	513	2015
Twice-ramanujan sparsifiers JD Batson, DA Spielman, N Srivastava Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009	507	2009
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	493	1998
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	461	2013
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	443	2014
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	415	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	412	2011
Spectral graph theory and its applications DA Spielman 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 29-38, 2007	375	2007
Spectral graph theory D Spielman Combinatorial scientific computing 18, 18, 2012	349	2012

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors