Daniel Spielman

Citata da

	Tutte	Dal 2019
Citazioni	22441	7567
Indice H	58	39
i10-index	92	62

1400

700

350

1050

199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202484 85 100 133 200 252 350 538 575 641 675 605 779 797 793 882 931 1091 1138 1227 1216 1208 1201 1214 1219 1216 1350 1365

Accesso pubblico

Visualizza tutto

7 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Amin ShokrollahiEPFLEmail verificata su epfl.ch
Nikhil SrivastavaUC BerkeleyEmail verificata su berkeley.edu
Michael MitzenmacherProfessor of Computer Science, Harvard UniversityEmail verificata su eecs.harvard.edu
Michael LubyBitRipple and ICSIEmail verificata su bitripple.com
Adam MarcusCo-Founder at Unlimited Labs/B12Email verificata su marcua.net
Andrew M. ChildsJoint Center for Quantum Information and Computer Science, University of MarylandEmail verificata su umd.edu
Joshua BatsonMIT Mathematics PhDEmail verificata su mit.edu
Richard PengCarnegie Mellon UniversityEmail verificata su cs.cmu.edu
Rasmus KyngETH ZurichEmail verificata su kyng.dk
John WrightElectrical Engineering, Columbia UniversityEmail verificata su columbia.edu
Yuval EmekTechnion - Israel Institute of TechnologyEmail verificata su technion.ac.il
Michael ElkinBen-Gurion University of the Negev, IsraelEmail verificata su cs.bgu.ac.il
Sushant SachdevaUToronto, Associate Professor. Vector Institute AffiliateEmail verificata su cs.toronto.edu
Ming CaoFull Professor of Systems and Control, University of Groningen, the NetherlandsEmail verificata su rug.nl
Yin Tat LeePaul G. Allen School of Computer Science & Engineering, University of WashingtonEmail verificata su uw.edu
Aleksander MądryMITEmail verificata su mit.edu
Paul ChristianoNational Institute of Standards and TechnologyEmail verificata su nist.gov
Marcos KiwiUniversity of ChileEmail verificata su dim.uchile.cl
Mohammad MahdianResearch Scientist, GoogleEmail verificata su alum.mit.edu
Louay BazziAmerican University of BeirutEmail verificata su aub.edu.lb

Segui

Daniel Spielman

Professor of Computer Science, Yale University

Email verificata su yale.edu - Home page

Theoretical Computer Science


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Efficient erasure correcting codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on Information Theory 47 (2), 569-584, 2001	1424	2001
Expander codes M Sipser, DA Spielman IEEE transactions on Information Theory 42 (6), 1710-1722, 1996	1333	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	1291	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	1286	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	1199	1997
Graph sparsification by effective resistances DA Spielman, N Srivastava Proceedings of the fortieth annual ACM symposium on Theory of computing, 563-568, 2008	1158	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	1123*	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	1095	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	818*	2007
Spectral sparsification of graphs DA Spielman, SH Teng SIAM Journal on Computing 40 (4), 981-1025, 2011	616	2011
Linear-time encodable and decodable error-correcting codes DA Spielman Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995	572	1995
Interlacing families ii: Mixed characteristic polynomials and the kadison—singer problem AW Marcus, DA Spielman, N Srivastava Annals of Mathematics, 327-350, 2015	531	2015
Twice-ramanujan sparsifiers JD Batson, DA Spielman, N Srivastava Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009	519	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	497	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	476	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	455	2014
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	425	2011
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	423	2013
Spectral graph theory and its applications DA Spielman 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 29-38, 2007	400	2007
Spectral graph theory D Spielman Combinatorial scientific computing 18, 18, 2012	373	2012

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori