Author of the publication

Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds

, , , , and . CoRR, (2012)

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

Communication-optimal Parallel and Sequential Cholesky Decomposition., , , and . SIAM J. Scientific Computing, 32 (6): 3495-3523 (2010)On the complexity of approximating tsp with neighborhoods and related problems., and . Computational Complexity, 14 (4): 281-307 (2006)Communication-Avoiding Symmetric-Indefinite Factorization., , , , , , , , and . SIAM J. Matrix Analysis Applications, 35 (4): 1364-1406 (2014)Communication-avoiding parallel strassen: implementation and performance., , , and . SC, page 101. IEEE/ACM, (2012)Poster: Beating MKL and ScaLAPACK at Rectangular Matrix Multiplication Using the BFS/DFS Approach., , , , , , and . SC Companion, page 1370. IEEE Computer Society, (2012)Cooperative TSP., , and . ESA, volume 4168 of Lecture Notes in Computer Science, page 40-51. Springer, (2006)On the complexity of approximating k-set packing., , and . Computational Complexity, 15 (1): 20-39 (2006)Improving the Numerical Stability of Fast Matrix Multiplication., , , , and . SIAM J. Matrix Analysis Applications, 37 (4): 1382-1418 (2016)Computing the Matched Filter in Linear Time, , , , and . CoRR, (2011)Communication-optimal Parallel and Sequential Cholesky Decomposition, , , and . CoRR, (2009)