Solving SDD linear systems in nearly m log 1/2 n time-Reference-Cited by-同舟云学术

Solving SDD linear systems in nearly m log 1/2 n time

Published:2014-05-31 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the forty-sixth annual ACM symposium on Theory of computing
language:
Short-container-title:

Author:

Cohen Michael B.¹,Kyng Rasmus²,Miller Gary L.³,Pachocki Jakub W.³,Peng Richard¹,Rao Anup B.²,Xu Shen Chen³

Affiliation:

1. M.I.T.

2. Yale University

3. Carnegie Mellon University

Funder

Division of Computing and Communication Foundations

Air Force Office of Scientific Research

Microsoft Research

Publisher

ACM

Link

Reference44 articles.

Cited by 100 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast Computation for the Forest Matrix of an Evolving Graph;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. A Framework for Parallelizing Approximate Gaussian Elimination;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

3. Resistance Eccentricity in Graphs: Distribution, Computation and Optimization;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13