![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Jeremiah Willcock
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [c22]Jeremiah Willcock, Andrew Lumsdaine
:
A Unifying Programming Model for Parallel Graph Algorithms. IPDPS Workshops 2015: 831-840 - 2013
- [c21]Andrew Lumsdaine
, Lili Lin, Jeremiah Willcock, Yuduo Zhou:
Fourier analysis of the focused plenoptic camera. Multimedia Content and Mobile Devices 2013: 86671M - [c20]Nicholas Gerard Edmonds, Jeremiah Willcock, Andrew Lumsdaine
:
Expressing graph algorithms using generalized active messages. ICS 2013: 283-292 - [c19]Nick Edmonds, Jeremiah Willcock, Andrew Lumsdaine
:
Expressing graph algorithms using generalized active messages. PPoPP 2013: 289-290 - [e1]Jacques Carette, Jeremiah Willcock:
Proceedings of the 9th ACM SIGPLAN workshop on Generic programming, WGP 2013, Boston, Massachusetts, USA, September 28, 2013. ACM 2013, ISBN 978-1-4503-2389-5 [contents] - 2012
- [c18]Jeremiah J. Willcock, Ryan R. Newton, Andrew Lumsdaine
:
Avalanche: a fine-grained flow graph model for irregular applications on distributed-memory systems. FHPC@ICFP 2012: 15-26 - [c17]Fabio Checconi, Fabrizio Petrini, Jeremiah Willcock, Andrew Lumsdaine
, Anamitra R. Choudhury, Yogish Sabharwal:
Breaking the speed and scalability barriers for graph exploration on distributed-memory machines. SC 2012: 13 - [c16]Jeremiah Willcock, Andrew Lumsdaine
:
Position Paper: Logic Programming for Parallel Irregular Applications. SC Companion 2012: 269-272 - 2011
- [c15]Fangzhou Jiao, Nilesh Mahajan, Jeremiah Willcock, Arun Chauhan, Andrew Lumsdaine
:
Partial globalization of partitioned address spaces for zero-copy communication with shared memory. HiPC 2011: 1-10 - [c14]Jeremiah Willcock, Torsten Hoefler, Nicholas Gerard Edmonds, Andrew Lumsdaine
:
Active pebbles: parallel programming for data-driven applications. ICS 2011: 235-244 - [c13]Eric Holk, William E. Byrd, Jeremiah Willcock, Torsten Hoefler, Arun Chauhan, Andrew Lumsdaine
:
Kanor - A Declarative Language for Explicit Communication. PADL 2011: 190-204 - [c12]Eric Holk, William E. Byrd, Nilesh Mahajan, Jeremiah Willcock, Arun Chauhan, Andrew Lumsdaine
:
Declarative Parallel Programming for GPUs. PARCO 2011: 297-304 - [c11]Jeremiah Willcock, Torsten Hoefler, Nicholas Gerard Edmonds, Andrew Lumsdaine
:
Active pebbles: a programming model for highly parallel fine-grained data-driven computations. PPoPP 2011: 305-306 - 2010
- [j3]Chunhua Liao, Daniel J. Quinlan, Jeremiah Willcock, Thomas Panas:
Semantic-Aware Automatic Parallelization of Modern Applications Using High-Level Abstractions. Int. J. Parallel Program. 38(5-6): 361-378 (2010) - [c10]Jeremiah Willcock, Torsten Hoefler, Nicholas Gerard Edmonds, Andrew Lumsdaine
:
AM++: a generalized active message framework. PACT 2010: 401-410
2000 – 2009
- 2009
- [c9]Jeremiah Willcock, Andrew Lumsdaine
, Daniel J. Quinlan:
Reusable, generic program analyses and transformations. GPCE 2009: 5-14 - [c8]Andreas Sæbjørnsen, Jeremiah Willcock, Thomas Panas, Daniel J. Quinlan, Zhendong Su
:
Detecting code clones in binary executables. ISSTA 2009: 117-128 - [c7]Chunhua Liao, Daniel J. Quinlan, Jeremiah Willcock, Thomas Panas:
Extending Automatic Parallelization to Optimize High-Level Abstractions for Multicore. IWOMP 2009: 28-41 - 2007
- [j2]Ronald Garcia, Jaakko Järvi, Andrew Lumsdaine
, Jeremy G. Siek
, Jeremiah Willcock:
An extended comparative study of language support for generic programming. J. Funct. Program. 17(2): 145-205 (2007) - 2006
- [c6]Jeremiah Willcock, Andrew Lumsdaine
:
Accelerating sparse matrix computations via data compression. ICS 2006: 307-316 - [c5]Jaakko Järvi, Douglas P. Gregor, Jeremiah Willcock, Andrew Lumsdaine
, Jeremy G. Siek
:
Algorithm specialization in generic programming: challenges of constrained generics in C++. PLDI 2006: 272-282 - 2005
- [j1]Jeremiah Willcock, Andrew Lumsdaine
, Arch D. Robison:
Using MPI with C# and the Common Language Infrastructure. Concurr. Pract. Exp. 17(7-8): 895-917 (2005) - [c4]Jaakko Järvi, Jeremiah Willcock, Andrew Lumsdaine
:
Associated types and constraint propagation for mainstream object-oriented generics. OOPSLA 2005: 1-19 - 2003
- [c3]Jaakko Järvi, Jeremiah Willcock, Andrew Lumsdaine
:
Concept-Controlled Polymorphism. GPCE 2003: 228-244 - [c2]Ronald Garcia, Jaakko Järvi, Andrew Lumsdaine
, Jeremy G. Siek, Jeremiah Willcock:
A comparative study of language support for generic programming. OOPSLA 2003: 115-134 - 2002
- [c1]Jeremiah Willcock, Andrew Lumsdaine, Arch D. Robison:
Using MPI with C# and the common language infrastructure. Java Grande 2002: 238
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint