关注
Willow Ahrens
Willow Ahrens
Graduate Student in Computer Science, MIT
在 csail.mit.edu 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Tensor algebra compilation with workspaces
F Kjolstad, W Ahrens, S Kamil, S Amarasinghe
2019 IEEE/ACM International Symposium on Code Generation and Optimization …, 2019
71*2019
Algorithms for efficient reproducible floating point summation
W Ahrens, J Demmel, HD Nguyen
ACM Transactions on Mathematical Software (TOMS) 46 (3), 1-49, 2020
60*2020
Autoscheduling for sparse tensor algebra with an asymptotic cost model
W Ahrens, F Kjolstad, S Amarasinghe
Proceedings of the 43rd ACM SIGPLAN International Conference on Programming …, 2022
27*2022
Looplets: A language for structured coiteration
W Ahrens, D Donenfeld, F Kjolstad, S Amarasinghe
Proceedings of the 21st ACM/IEEE International Symposium on Code Generation …, 2023
142023
Parallel compact hash algorithms for computational meshes
R Tumblin, W Ahrens, S Hartse, RW Robey
SIAM Journal on Scientific Computing 37 (1), C31-C53, 2015
122015
A fill estimation algorithm for sparse matrices and tensors in blocked formats
W Ahrens, H Xu, N Schiefer
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2018
9*2018
Sparse tensor transpositions
S Mueller, W Ahrens, S Chou, F Kjolstad, S Amarasinghe
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020
62020
On Optimal Partitioning For Sparse Matrices In Variable Block Row Format
W Ahrens, EG Boman
arXiv preprint arXiv:2005.12414, 2020
62020
Finch: Sparse and Structured Array Programming with Control Flow
W Ahrens, TF Collin, R Patel, K Deeds, C Hong, S Amarasinghe
arXiv preprint arXiv:2404.16730, 2024
22024
Reproducible BLAS: Make addition associative again!
J Demmel, J Riedy, W Ahrens
SIAM News 51 (8), 8, 2018
22018
The Continuous Tensor Abstraction: Where Indices are Real
J Won, W Ahrens, JS Emer, S Amarasinghe
arXiv preprint arXiv:2407.01742, 2024
2024
SySTeC: A Symmetric Sparse Tensor Compiler
R Patel, W Ahrens, S Amarasinghe
arXiv preprint arXiv:2406.09266, 2024
2024
Mechanised Hypersafety Proofs about Structured Data: Extended Version
V Gladshtein, Q Zhao, W Ahrens, S Amarasinghe, I Sergey
arXiv preprint arXiv:2404.06477, 2024
2024
Contiguous Graph Partitioning For Optimal Total Or Bottleneck Communication
W Ahrens
arXiv preprint arXiv:2007.16192, 2020
2020
LATE Ain'T Earley: A Faster Parallel Earley Parser
W Ahrens, J Feser, R Hui
arXiv preprint arXiv:1807.05642, 2018
2018
Branchless Reproducible Floating Point Summation With Integers, Version 1. xx
W Ahrens
Los Alamos National Lab.(LANL), Los Alamos, NM (United States), 2016
2016
系统目前无法执行此操作,请稍后再试。
文章 1–16