Richard Peng

Cited by

	All	Since 2016
Citations	2838	2195
h-index	29	28
i10-index	43	43

600

300

150

450

20102011201220132014201520162017201820192020202110 35 60 97 161 218 270 302 381 465 586 189

Public access

View all

25 articles

1 article

available

not available

Based on funding mandates

Co-authors

Gary L. MillerCarnegie Mellon UniversityVerified email at cs.cmu.edu
Ioannis KoutisNew Jersey Institute of TechnologyVerified email at njit.edu
Shen Chen XuCarnegie Mellon UniversityVerified email at cs.cmu.edu
Rasmus KyngETH ZurichVerified email at kyng.dk
Anup B. RaoGeorgia Institute of TechnologyVerified email at gatech.edu
Aaron SidfordStanford UniversityVerified email at stanford.edu
Charalampos E. TsourakakisBoston University, ISI Foundation, Harvard UniversityVerified email at seas.harvard.edu
Michael B. CohenGraduate Student in Computer Science, MITVerified email at mit.edu
Sushant SachdevaUTorontoVerified email at cs.toronto.edu
Yin Tat LeePaul G. Allen School of Computer Science & Engineering, University of WashingtonVerified email at uw.edu
Saurabh SawlaniCarnegie Mellon UniversityVerified email at cmu.edu
Daniel SpielmanProfessor of Computer Science, Yale UniversityVerified email at yale.edu
Adrian VladuIRIF, Université de ParisVerified email at mit.edu
Kanat TangwongsanMahidol University International CollegeVerified email at mahidol.edu
Thatchaphol SaranurakUniversity of MichiganVerified email at umich.edu
Dehua ChengUniversity of Southern CaliforniaVerified email at usc.edu
Mihalis KolountzakisProfessor of Mathematics, University of Crete, GreeceVerified email at math.uoc.gr
Gramoz GoranciUniversity of TorontoVerified email at cs.toronto.edu
Danupon NanongkaiAssociate Professor, KTH Royal Institute of Technology, Stockholm, SwedenVerified email at kth.se
Guy BlellochProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu

Richard Peng

Georgia Tech

Verified email at cc.gatech.edu - Homepage

algorithms combinatorial scientific computing data structures


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Approaching optimality for solving SDD linear systems I Koutis, GL Miller, R Peng SIAM Journal on Computing 43 (1), 337-354, 2014	280	2014
A nearly-m log n time solver for SDD linear systems I Koutis, GL Miller, R Peng Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on …, 2011	253	2011
Solving SDD linear systems in nearly mlog^1/2n time MB Cohen, R Kyng, GL Miller, JW Pachocki, R Peng, AB Rao, SC Xu Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014	162*	2014
Uniform sampling for matrix approximation MB Cohen, YT Lee, C Musco, C Musco, R Peng, A Sidford Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015	156	2015
Efficient triangle counting in large graphs via degree-based vertex partitioning MN Kolountzakis, GL Miller, R Peng, CE Tsourakakis Internet Mathematics 8 (1-2), 161-185, 2012	144	2012
An efficient parallel solver for SDD linear systems R Peng, DA Spielman Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014	118	2014
Fully dynamic (1+ e)-approximate matchings M Gupta, R Peng 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 548-557, 2013	111	2013
Sparsified cholesky and multigrid solvers for connection laplacians R Kyng, YT Lee, R Peng, S Sachdeva, DA Spielman Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	108*	2016
Iterative row sampling M Li, GL Miller, R Peng 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 127-136, 2013	87*	2013
Parallel graph decompositions using random shifts GL Miller, R Peng, SC Xu Proceedings of the twenty-fifth annual ACM symposium on Parallelism in …, 2013	84	2013
Faster spectral sparsification and numerical algorithms for SDD matrices I Koutis, A Levin, R Peng arXiv preprint arXiv:1209.5821, 2012	73*	2012
Approximate Undirected Maximum Flows in O(mpolylog(n)) Time R Peng Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016	72	2016
Partitioning well-clustered graphs: Spectral clustering works! R Peng, H Sun, L Zanetti Conference on Learning Theory, 1423-1455, 2015	68	2015
Scalable large near-clique detection in large-scale networks via sampling M Mitzenmacher, J Pachocki, R Peng, C Tsourakakis, SC Xu Proceedings of the 21th ACM SIGKDD International Conference on Knowledge …, 2015	65	2015
Almost-linear-time algorithms for markov chains and new spectral primitives for directed graphs MB Cohen, J Kelner, J Peebles, R Peng, AB Rao, A Sidford, A Vladu Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	62	2017
Linear-work greedy parallel approximate set cover and variants GE Blelloch, R Peng, K Tangwongsan Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011	62	2011
Improved parallel algorithms for spanners and hopsets GL Miller, R Peng, A Vladu, SC Xu Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and …, 2015	55	2015
Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs GE Blelloch, A Gupta, I Koutis, GL Miller, R Peng, K Tangwongsan Theory of Computing Systems 55 (3), 521-554, 2014	54	2014
L_p Row Sampling by Lewis Weights MB Cohen, R Peng Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015	53	2015
On fully dynamic graph sparsifiers I Abraham, D Durfee, I Koutis, S Krinninger, R Peng 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016	52	2016

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

Upload PDF

Follow this author

Cited by

Co-authors