Publications
- Communication-Optimal Loop Nests
- Write-Avoiding Algorithms
- S-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid
- Avoiding Communication in Successive Band Reduction
- Communication Lower Bounds and Optimal Algorithms for Numerical Linear Algebra
- Exploiting Data Sparsity in Parallel Matrix Powers Computations
- Tradeoffs between synchronization, communication, and work in parallel linear algebra computations
- Communication Lower Bounds and Optimal Algorithms for Programs That Reference Arrays | Part 1