A breakthrough in algorithm design

Authors:
Kirk L. Kroeker
Affiliations:
-
Venue:
Communications of the ACM
Year:
2011

Citing 5
Cited 0

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing

ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid

Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Approaching Optimality for Solving SDD Linear Systems

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
The laplacian paradigm: emerging algorithms for massive graphs

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	48.22

Visualization

Abstract

Computer scientists at Carnegie Mellon University have devised an algorithm that might be able to solve a certain class of linear systems much more quickly than today's fastest solvers.