Willow Ahrens

Orcid: 0000-0002-4963-0869

Affiliations:
  • MIT, Cambridge, MA, USA


According to our database1, Willow Ahrens authored at least 11 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Looplets: A Language for Structured Coiteration.
Proceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization, 2023

2022
Autoscheduling for sparse tensor algebra with an asymptotic cost model.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

2021
An Asymptotic Cost Model for Autoscheduling Sparse Tensor Programs.
CoRR, 2021

2020
Algorithms for Efficient Reproducible Floating Point Summation.
ACM Trans. Math. Softw., 2020

Load Plus Communication Balancing in Contiguous Partitions for Distributed Sparse Matrices: Linear-Time Algorithms.
CoRR, 2020

On Optimal Partitioning For Sparse Matrices In Variable Block Row Format.
CoRR, 2020

Sparse Tensor Transpositions.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019
Tensor Algebra Compilation with Workspaces.
Proceedings of the IEEE/ACM International Symposium on Code Generation and Optimization, 2019

2018
LATE Ain'T Earley: A Faster Parallel Earley Parser.
CoRR, 2018

A Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2015
Parallel Compact Hash Algorithms for Computational Meshes.
SIAM J. Sci. Comput., 2015


  Loading...