default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWillow Ahrens
Person information
- affiliation: MIT, Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Vladimir Gladshtein
, Qiyuan Zhao, Willow Ahrens, Saman P. Amarasinghe, Ilya Sergey:
Mechanised Hypersafety Proofs about Structured Data. Proc. ACM Program. Lang. 8(PLDI): 647-670 (2024)- [i11]Vladimir Gladshtein, Qiyuan Zhao, Willow Ahrens, Saman P. Amarasinghe, Ilya Sergey:
Mechanised Hypersafety Proofs about Structured Data: Extended Version. CoRR abs/2404.06477 (2024) - [i10]Willow Ahrens, Teodoro Fields Collin, Radha Patel, Kyle Deeds, Changwan Hong, Saman P. Amarasinghe:
Finch: Sparse and Structured Array Programming with Control Flow. CoRR abs/2404.16730 (2024) - [i9]Radha Patel, Willow Ahrens, Saman P. Amarasinghe:
SySTeC: A Symmetric Sparse Tensor Compiler. CoRR abs/2406.09266 (2024) - [i8]Jaeyeon Won, Willow Ahrens, Joel S. Emer, Saman P. Amarasinghe:
The Continuous Tensor Abstraction: Where Indices are Real. CoRR abs/2407.01742 (2024) - [i7]Kyle Deeds, Willow Ahrens, Magda Balazinska, Dan Suciu:
Galley: Modern Query Optimization for Sparse Tensor Programs. CoRR abs/2408.14706 (2024) - 2023
- [c5]Willow Ahrens, Daniel Donenfeld, Fredrik Kjolstad, Saman P. Amarasinghe:
Looplets: A Language for Structured Coiteration. CGO 2023: 41-54 - [d1]Willow Ahrens, Daniel Donenfeld, Fredrik Kjolstad, Saman P. Amarasinghe:
Looplets: A Language For Structured Coiteration (The Artifact). Zenodo, 2023
- 2022
- [c4]Willow Ahrens, Fredrik Kjolstad, Saman P. Amarasinghe:
Autoscheduling for sparse tensor algebra with an asymptotic cost model. PLDI 2022: 269-285 - [i6]Willow Ahrens, Daniel Donenfeld, Fredrik Kjolstad, Saman P. Amarasinghe:
Looplets: A Language For Structured Coiteration. CoRR abs/2209.05250 (2022) - 2021
- [i5]Willow Ahrens, Fredrik Kjolstad, Saman P. Amarasinghe:
An Asymptotic Cost Model for Autoscheduling Sparse Tensor Programs. CoRR abs/2111.14947 (2021) - 2020
- [j2]Willow Ahrens, James Demmel, Hong Diep Nguyen:
Algorithms for Efficient Reproducible Floating Point Summation. ACM Trans. Math. Softw. 46(3): 22:1-22:49 (2020) - [c3]Suzanne Mueller, Willow Ahrens, Stephen Chou, Fredrik Kjolstad, Saman P. Amarasinghe:
Sparse Tensor Transpositions. SPAA 2020: 559-561 - [i4]Suzanne Mueller, Willow Ahrens, Stephen Chou, Fredrik Kjolstad, Saman P. Amarasinghe:
Sparse Tensor Transpositions. CoRR abs/2005.10427 (2020) - [i3]Willow Ahrens, Erik G. Boman:
On Optimal Partitioning For Sparse Matrices In Variable Block Row Format. CoRR abs/2005.12414 (2020) - [i2]Willow Ahrens:
Load Plus Communication Balancing in Contiguous Partitions for Distributed Sparse Matrices: Linear-Time Algorithms. CoRR abs/2007.16192 (2020)
2010 – 2019
- 2019
- [c2]Fredrik Kjolstad, Willow Ahrens, Shoaib Kamil, Saman P. Amarasinghe:
Tensor Algebra Compilation with Workspaces. CGO 2019: 180-192 - 2018
- [c1]Willow Ahrens, Helen Xu, Nicholas Schiefer:
A Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats. IPDPS 2018: 546-556 - [i1]Willow Ahrens, John Feser, Robin Hui:
LATE Ain'T Earley: A Faster Parallel Earley Parser. CoRR abs/1807.05642 (2018) - 2015
- [j1]Rebecka Tumblin, Willow Ahrens, Sara Hartse, Robert W. Robey:
Parallel Compact Hash Algorithms for Computational Meshes. SIAM J. Sci. Comput. 37(1) (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
