Author of the publication

Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs.

, , , , , and . SPAA, page 13-22. ACM, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Solving SDD linear systems in nearly mlog1/2n time., , , , , , and . STOC, page 343-352. ACM, (2014)Offline Dynamic Higher Connectivity., , and . CoRR, (2017)Partitioning Well-Clustered Graphs: Spectral Clustering Works!, , and . COLT, volume 40 of JMLR Workshop and Conference Proceedings, page 1423-1455. JMLR.org, (2015)Lp Row Sampling by Lewis Weights., and . STOC, page 183-192. ACM, (2015)Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices., , and . STACS, volume 14 of LIPIcs, page 266-277. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Current Flow Group Closeness Centrality for Complex Networks?, , , , and . WWW, page 961-971. ACM, (2019)Distance Queries over Dynamic Interval Graphs., , , , , and . ISAAC, volume 283 of LIPIcs, page 18:1-18:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Exponential Convergence of Sinkhorn Under Regularization Scheduling., , , , and . ACDA, page 180-188. SIAM, (2023)Approximate Undirected Maximum Flows in O(mpolylog(n)) Time.. SODA, page 1862-1867. SIAM, (2016)A Framework for Analyzing Resparsification Algorithms., , , and . SODA, page 2032-2043. SIAM, (2017)