default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSam Westrick
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Alexandre Moine
, Sam Westrick, Stephanie Balzer:
DisLog: A Separation Logic for Disentanglement. Proc. ACM Program. Lang. 8(POPL): 302-331 (2024)- [j6]Sam Westrick, Matthew Fluet, Mike Rainey, Umut A. Acar:
Automatic Parallelism Management. Proc. ACM Program. Lang. 8(POPL): 1118-1149 (2024) - 2023
- [j5]Jatin Arora, Sam Westrick, Umut A. Acar:
Efficient Parallel Functional Programming with Effects. Proc. ACM Program. Lang. 7(PLDI): 1558-1583 (2023) - [c5]Michael Wilkins, Sam Westrick, Vijay Kandiah, Alex Bernat, Brian Suchy, Enrico Armenio Deiana, Simone Campanoni, Umut A. Acar, Peter A. Dinda, Nikos Hardavellas:
WARDen: Specializing Cache Coherence for High-Level Parallel Languages. CGO 2023: 122-135 - [e1]Gabriele Keller, Sam Westrick:
Proceedings of the 11th ACM SIGPLAN International Workshop on Functional High-Performance and Numerical Computing, FHPNC 2023, Seattle, WA, USA, 4 September 2023. ACM 2023 [contents] - 2022
- [j4]Sam Westrick, Jatin Arora, Umut A. Acar:
Entanglement detection with near-zero cost. Proc. ACM Program. Lang. 6(ICFP): 679-710 (2022) - [c4]Sam Westrick, Mike Rainey, Daniel Anderson, Guy E. Blelloch:
Parallel block-delayed sequences. PPoPP 2022: 61-75 - [i3]Sam Westrick, Larry Wang, Umut A. Acar:
DePa: Simple, Provably Efficient, and Practical Order Maintenance for Task Parallelism. CoRR abs/2204.14168 (2022) - 2021
- [j3]Jatin Arora, Sam Westrick, Umut A. Acar:
Provably space-efficient parallel functional programming. Proc. ACM Program. Lang. 5(POPL): 1-33 (2021) - 2020
- [j2]Sam Westrick, Rohan Yadav, Matthew Fluet, Umut A. Acar:
Disentanglement in nested-parallel programs. Proc. ACM Program. Lang. 4(POPL): 47:1-47:32 (2020) - [c3]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick:
Parallel Batch-Dynamic Trees via Change Propagation. ESA 2020: 2:1-2:23 - [i2]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick:
Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees. CoRR abs/2002.05129 (2020)
2010 – 2019
- 2019
- [j1]Stefan K. Muller, Sam Westrick, Umut A. Acar:
Fairness in responsive parallelism. Proc. ACM Program. Lang. 3(ICFP): 81:1-81:30 (2019) - 2018
- [c2]Adrien Guatto, Sam Westrick, Ram Raghunathan, Umut A. Acar, Matthew Fluet:
Hierarchical memory management for mutable state. PPoPP 2018: 81-93 - [i1]Adrien Guatto, Sam Westrick, Ram Raghunathan, Umut A. Acar, Matthew Fluet:
Hierarchical Memory Management for Mutable State. CoRR abs/1801.04618 (2018) - 2017
- [c1]Umut A. Acar, Vitaly Aksenov, Sam Westrick:
Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation. SPAA 2017: 275-277
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-09 21:29 CEST 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:
