Publications
Interface for Sparse Linear Algebra Operations
Ahmad Abdelfattah, Willow Ahrens, Hartwig Anzt, Chris Armstrong, Ben Brock, Aydin Buluc, Federico Busato, Terry Cojean, Tim Davis, Jim Demmel, Grace Dinh, David Gardener, Jan Fiala, Mark Gates, Azzam Haider, Toshiyuki Imamura, Pedro Valero Lara, Jose Moreira, Sherry Li, Piotr Luszczek, Max Melichenko, Jose Moeira, Yvan Mokwinski, Riley Murray, Spencer Patty, Slaven Peles, Tobias Ribizel, Jason Riedy, Siva Rajamanickam, Piyush Sao, Manu Shantharam, Keita Teranishi, Stan Tomov, Yu-Hsiang Tsai, and Heiko Weichelt, “Interface for Sparse Linear Algebra Operations,” arXiv, November 2024. Link. Download.
Galley: Modern Query Optimization for Sparse Tensor Programs
Kyle Deeds, Willow Ahrens, Magda Balazinska, and Dan Suciu, “Galley: Modern Query Optimization for Sparse Tensor Programs,” arXiv, August 2024. Link. Download.
The Continuous Tensor Abstraction: Where Indices are Real
Jaeyeon Won, Willow Ahrens, Joel S. Emer, and Saman Amarasinghe, “The Continuous Tensor Abstraction: Where Indices are Real,” arXiv, July 2024. Link. Download.
SySTeC: A Symmetric Sparse Tensor Compiler
Radha Patel, Willow Ahrens, and Saman Amarasinghe, “SySTeC: A Symmetric Sparse Tensor Compiler,” arXiv, June 2024. Link. Download.
Mechanised Hypersafety Proofs about Structured Data
Vladimir Gladshtein, Qiyuan Zhao, Willow Ahrens, Saman Amarasinghe, and Ilya Sergey, “Mechanised Hypersafety Proofs about Structured Data,” PLDI, June 2024. Link. Download.
Finch: Sparse and Structured Array Programming with Control Flow
Willow Ahrens, Teodoro Fields Collin, Radha Patel, Kyle Deeds, Changwan Hong, and Saman Amarasinghe, “Finch: Sparse and Structured Array Programming with Control Flow,” arXiv, April 2024. Link. Download.
Looplets: A Language for Structured Coiteration
Willow Ahrens, Daniel Donenfeld, Fredrik Kjolstad, and Saman Amarasinghe, “Looplets: A Language for Structured Coiteration,” CGO, February 2023. Link. Download.
Autoscheduling for sparse tensor algebra with an asymptotic cost model
Willow Ahrens, Fredrik Kjolstad, and Saman Amarasinghe, “Autoscheduling for sparse tensor algebra with an asymptotic cost model,” PLDI, June 2022. Link. Download.
Contiguous Graph Partitioning For Optimal Total Or Bottleneck Communication
Willow Ahrens, “Contiguous Graph Partitioning For Optimal Total Or Bottleneck Communication,” arXiv, June 2021. Link. Download.
On Optimal Partitioning For Sparse Matrices In Variable Block Row Format
Willow Ahrens, and Erik G. Boman, “On Optimal Partitioning For Sparse Matrices In Variable Block Row Format,” arXiv, May 2021. Link. Download.
Algorithms for Efficient Reproducible Floating Point Summation
Willow Ahrens, James Demmel, and Hong Diep Nguyen, “Algorithms for Efficient Reproducible Floating Point Summation,” ACM Trans. Math. Softw., July 2020. Link. Download.
Sparse Tensor Transpositions: Brief Announcement
Suzanne Mueller, Willow Ahrens, Stephen Chou, Fredrik Kjolstad, and Saman Amarasinghe, “Sparse Tensor Transpositions: Brief Announcement,” SPAA, July 2020. Link. Download.
Sparse Tensor Transpositions
Suzanne Mueller, Willow Ahrens, Stephen Chou, Fredrik Kjolstad, and Saman Amarasinghe, “Sparse Tensor Transpositions,” arXiv, May 2020. Link. Download.
Tensor Algebra Compilation with Workspaces
Fredrik Kjolstad, Willow Ahrens, Shoaib Kamil, and Saman Amarasinghe, “Tensor Algebra Compilation with Workspaces,” CGO, February 2019. Link. Download.
A Parallel Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats
Willow Ahrens, “A Parallel Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats,” Master’s Thesis, Massachusetts Institute of Technology, 2019. Link. Download.
LATE Ain’T Earley: A Faster Parallel Earley Parser
Willow Ahrens, John Feser, and Robin Hui, “LATE Ain’T Earley: A Faster Parallel Earley Parser,” arXiv, July 2018. Link. Download.
A Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats
Willow Ahrens, Helen Xu, and Nicholas Schiefer, “A Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats,” IPDPS, May 2018. Link. Download.
Efficient Reproducible Floating Point Summation and BLAS
W. Ahrens, J. Demmel, and H. D. Nguyen, “Efficient Reproducible Floating Point Summation and BLAS,” EECS Department, University of California, Berkeley, June 2016. Link. Download.
Parallel Compact Hash Algorithms for Computational Meshes
R. Tumblin, W. Ahrens, S. Hartse, and R. Robey, “Parallel Compact Hash Algorithms for Computational Meshes,” SIAM J. Sci. Comput., January 2015. Link. Download.