AN17 - MS76-1: Communication-Avoiding Algorithms: Challenges and New Results Presentation: Erin C. Carson, New York University, USA, 28 min 39 sec
AN17 - MS76-1: Communication-Avoiding Algorithms: Challenges and New Results Document: AN17 - MS76-1: Communication-Avoiding Algorithms: Challenges and New Results(PDF)
AN17 - MS76-2: Communication-Optimal Loop Nests Presentation: Nicholas Knight, New York University, USA, 30 min 6 sec
AN17 - MS76-2: Communication-Optimal Loop Nests Document: AN17 - MS76-2: Communication-Optimal Loop Nests(PDF)
AN17 - MS76-3: Communication Lower Bounds for Matricized-Tensor Times Khatri-Rao Product Presentation: Grey Ballard, Wake Forest University, USA, 26 min 37 sec
AN17 - MS76-3: Communication Lower Bounds for Matricized-Tensor Times Khatri-Rao Product Document: AN17 - MS76-3: Communication Lower Bounds for Matricized-Tensor Times Khatri-Rao Product(PDF)
AN17 - MS76-4: Matrix Multiplication, a Little Faster Presentation: Elaye E. Karstadt, Hebrew University of Jerusalem, Israel, 23 min 47 sec
AN17 - MS76-4: Matrix Multiplication, a Little Faster Document: AN17 - MS76-4: Matrix Multiplication, a Little Faster(PDF)