Slides from talks

• Challenges in Combinatorial Scientific Computing (SIAM Annual Meeting, July 2009)
• 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
• Graph Algorithms in Numerical Linear Algebra: Past, Present, and Future
• Symmetric Weighted Matching for Indefinite Systems
• Sparse Matrix Days in MIT 18.337: Day 1, Day 2, Day 3
• The Evolution of A Sparse Partial Pivoting Algorithm