activity
20222026
most citedMechanised Hypersafety Proofs about Structured Data: Extended Version

8 citations · 11 across the 8 of their papers we have counts for

collaborators

9 papers

cs.DC2026

Parallel Sparse Outputs for Tensor Compilers

Adrian Gushin, Pau Sum, Willow Ahrens

Sparse tensor compilers are commonly used high-performance tools that optimize tensor algebra programs over notoriously complex sparse data structures. Despite the ever-increasing…

cs.MS2026

WingSpan: Concurrency and Dependence for Sparse and Structured Tensor Compilers

Adrian Gushin, Sang Yoon Kim, Willow Ahrens

Sparse tensors represent data that is mostly zero or some other compressible fill pattern. Such datasets can be massive, so optimized tensor algebra libraries and compilers have be…

cs.PL2025

Insum: Sparse GPU Kernels Simplified and Optimized with Indirect Einsums

Jaeyeon Won, Willow Ahrens, Joel S. Emer +1

Programming high-performance sparse GPU kernels is notoriously difficult, requiring both substantial effort and deep expertise. Sparse compilers aim to simplify this process, but e…

cs.DB2024

Galley: Modern Query Optimization for Sparse Tensor Programs

Kyle Deeds, Willow Ahrens, Magda Balazinska +1

The tensor programming abstraction is a foundational paradigm which allows users to write high performance programs via a high-level imperative interface. Recent work on sparse ten…

cs.PL2024★ 1 cited

The Continuous Tensor Abstraction: Where Indices are Real

Jaeyeon Won, Willow Ahrens, Teodoro Fields Collin +2

This paper introduces the continuous tensor abstraction, allowing indices to take real-number values (for example, A[3.14]). It also presents continuous tensor algebra expressions,…

cs.MS2024

SySTeC: A Symmetric Sparse Tensor Compiler

Radha Patel, Willow Ahrens, Saman Amarasinghe

Symmetric and sparse tensors arise naturally in many domains including linear algebra, statistics, physics, chemistry, and graph theory. Symmetric tensors are equal to their transp…

cs.PL2024★ 8 cited

Mechanised Hypersafety Proofs about Structured Data: Extended Version

Vladimir Gladshtein, Qiyuan Zhao, Willow Ahrens +2

Arrays are a fundamental abstraction to represent collections of data. It is often possible to exploit structural properties of the data stored in an array (e.g., repetition or spa…

cs.MS2024★ 2 cited

Finch: Sparse and Structured Tensor Programming with Control Flow

Willow Ahrens, Teodoro Fields Collin, Radha Patel +3

From FORTRAN to NumPy, tensors have revolutionized how we express computation. However, tensors in these, and almost all prominent systems, can only handle dense rectilinear intege…

cs.PL2022

Looplets: A Language For Structured Coiteration

Willow Ahrens, Daniel Donenfeld, Fredrik Kjolstad +1

Real world arrays often contain underlying structure, such as sparsity, runs of repeated values, or symmetry. Specializing for structure yields significant speedups. But automatica…