# Grey Ballard

## Publications

- 2013, Graph Expansion and Communication Costs of Algorithms
- 2013, Communication Efficient Gaussian Elimination with Partial Pivoting using a Shape Morphing Data Layout
- 2013, Communication Costs of Strassen's Matrix Multiplication
- 2012, Communication-Optimal Parallel Algorithm for Strassen's Matrix Multiplication
- 2012, Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Lower Bounds
- 2012, Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication
- 2012, Communication-Avoiding Parallel Strassen: Implementation and Performance
- 2012, Communication-Optimal Parallel Algorithm for Strassen’s Matrix Multiplication
- 2011, Communication-Avoiding QR Decomposition for GPU's
- 2011, Graph Expansion and Communication Costs of Fast Matrix Multiplication
- 2011, Minimizing Communication in Numerical Linear Algebra
- 2011, Rethinking Algorithms for Future Architectrues: Communication-Avoiding Algorithms
- 2011, BEST PAPER AWARD: Graph Expansion and Communication Costs of Fast Matrix Multiplication
- 2011, Brief Announcement: Communication Bounds for Heterogeneous Architectures
- 2011, Communication Bounds for Heterogeneous Architectures
- 2011, Communication Bounds for Heterogeneous Architectures
- 2010, Minimizing Communication for Eigenproblems and the Singular Value Decomposition
- 2009, Communication Optimal Parallel and Sequential Cholesky Factorization
- 2009, Minimizing Communication in Linear Algebra
- 2009, Communication-Optimal Parallel and Sequential Eigenvalue/SVD Algorithms