Остановите войну!
for scientists:
default search action
Jeremy T. Fineman
- > Home > Persons > Jeremy T. Fineman
Publications
- 2020
- [c54]Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun:
Optimal Parallel Algorithms in the Binary-Forking Model. SPAA 2020: 89-102 - 2019
- [i14]Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun:
Optimal Parallel Algorithms in the Binary-Forking Model. CoRR abs/1903.04650 (2019) - 2018
- [c49]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Implicit Decomposition for Write-Efficient Connectivity Algorithms. IPDPS 2018: 711-722 - 2017
- [i12]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Implicit Decomposition for Write-Efficient Connectivity Algorithms. CoRR abs/1710.02637 (2017) - 2016
- [j4]Harsha Vardhan Simhadri, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola:
Experimental Analysis of Space-Bounded Schedulers. ACM Trans. Parallel Comput. 3(1): 8:1-8:27 (2016) - [c42]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Efficient Algorithms with Asymmetric Read and Write Costs. ESA 2016: 14:1-14:18 - [c35]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Parallel Algorithms for Asymmetric Read-Write Costs. SPAA 2016: 145-156 - [i10]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Sorting with Asymmetric Read and Write Costs. CoRR abs/1603.03505 (2016) - 2015
- [c34]Julian Shun, Yan Gu, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons:
Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel. SODA 2015: 431-448 - [c33]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Sorting with Asymmetric Read and Write Costs. SPAA 2015: 1-12 - [i8]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Efficient Algorithms under Asymmetric Read and Write Costs. CoRR abs/1511.01038 (2015) - 2014
- [c23]Harsha Vardhan Simhadri, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola:
Experimental analysis of space-bounded schedulers. SPAA 2014: 30-41 - 2013
- [c20]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Program-centric cost models for locality. MSPC@PLDI 2013: 6:1-6:2 - [c18]Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons:
Reducing contention through priority updates. PPoPP 2013: 299-300 - [c17]Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons:
Reducing contention through priority updates. SPAA 2013: 152-163 - 2012
- [c15]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Julian Shun:
Internally deterministic parallel algorithms can be fast. PPoPP 2012: 181-192 - [c14]Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri, Kanat Tangwongsan:
Brief announcement: the problem based benchmark suite. SPAA 2012: 68-70 - [c12]Guy E. Blelloch, Jeremy T. Fineman, Julian Shun:
Greedy sequential maximal independent set and matching are parallel on average. SPAA 2012: 308-317 - [i3]Guy E. Blelloch, Jeremy T. Fineman, Julian Shun:
Greedy Sequential Maximal Independent Set and Matching are Parallel on Average. CoRR abs/1202.3205 (2012) - 2011
- [c11]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Scheduling irregular parallel computations on hierarchical caches. SPAA 2011: 355-366
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-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint