A breakthrough in algorithm design

Communications of the ACM

Volumn 54, Issue 9, 2011, Pages 13-15

  Kroeker, Kirk L ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM DESIGN; CARNEGIE MELLON UNIVERSITY; COMPUTER SCIENTISTS;

LINEAR SYSTEMS;

ALGORITHMS;

EID: 80052312165     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/1995376.1995382     Document Type: Article

References (5)

1. Koutis, I., Miller, G.L., and Peng, R. Approaching optimality for solving SDD linear systems, Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, Las Vegas, NV, Oct. 23-26, 2010.
2. Spielman, D.A. and Teng, S-H. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, June 13-16, 2004.
3. Koutis, I., Miller, G.L., and Tolliver, D. Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing, Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I, Las Vegas, NV, Nov. 30-Dec. 2, 2009.
4. Blelloch, G.E., Koutis, I., Miller, G.L., and Tangwongsan, K. 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, New Orleans, LA, Nov. 13-19, 2010.
5. Teng, S.-H. The Laplacian paradigm: Emerging algorithms for massive graphs. Lecture Notes in Computer Science 6108, Kratochvíl, J., Li, A., Fiala, J., and Kolman, P. (Eds.), Springer-Verlag, Berlin, Germany, 2010.