Slides from talks
Building Blocks for Graph Algorithms in the Language of Linear Algebra
(Toulouse Clustering Workshop, July 2015)
Empirical Complexity of Laplacian Linear Solvers
(Simons Institute, December 2014)
Sparse Matrices for High-Performance Graph Analytics
(Oak Ridge National Lab, October 2014)
Graphs in the Language of Linear Algebra: Applications, Software, and Challenges
(IPDPS GABB, May 2014)
Sparse Matrices and Graphs: There and Back Again
[
video
] (Simons Institute, October 2013)
Sparse Matrices for High-Performance Graph Analytics
(CLSAC, October 2013)
Sparse Matrices for High-Performance Graph Computation
(l'Ecole Normale SupĂ©rieure de Lyon, September 2012)
A Toolbox for High-Performance Graph Computation
(UC Berkeley, September 2011)
Combinatorial Scientific Computing: Tutorial, Experiences, and Challenges
(MMDS, June 2010)
High-Performance Computation for Path Problems in Graphs
(SIAM Dynamical Systems, May 2009)
Combinatorial Scientific Computing: Experiences, Directions, and Challenges
(CSCAPES workshop, June 2008)
A High-Performance Interactive Tool for Exploring Large Graphs
(ICIAM, July 2007)
An Interactive Environment for Combinatorial Supercomputing
(MIT CRiB seminar, July 2006)
Applied Mathematics
(Bethlehem Middle School Career Day, March 2005)
Workflow Analysis of Student Data
(HPCS, January 2005)
Sparse Matrix Algorithms
(slides from CS 290H, Fall 2004)
Matlab*P: Graphs and Sparse Matrices in an Interactive Supercomputing Environment
(SIAM, July 2004)
Support-Graph Preconditioning
(MIT, November 2002)
Graph Algorithms in Numerical Linear Algebra: Past, Present, and Future
(Pacific Northwest NA Seminar, September 2002)
Symmetric Weighted Matching for Indefinite Systems
(Householder, June 2002)
Sparse Matrix Days in MIT 18.337:
Day 1
,
Day 2
,
Day 3
(MIT, April 2002)
The Evolution of A Sparse Partial Pivoting Algorithm
(University of Nancy, June 2001)