default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrey Prokopenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Hyun-Gyu Kang
, Raymond S. Tuminaro, Andrey Prokopenko, Seth R. Johnson, Andrew G. Salinger, Katherine J. Evans:
An implicit barotropic mode solver for MPAS-ocean using a modern Fortran solver interface. Int. J. High Perform. Comput. Appl. 38(3): 175-191 (2024)- [c6]Piyush Sao, Andrey Prokopenko, Damien Lebrun-Grandié:
PANDORA: A Parallel Dendrogram Construction Algorithm for Single Linkage Clustering on GPU. ICPP 2024: 908-918 - [i7]Piyush Sao, Andrey Prokopenko, Damien Lebrun-Grandié:
PANDORA: A Parallel Dendrogram Construction Algorithm for Single Linkage Clustering on GPU. CoRR abs/2401.06089 (2024) - [i6]Andrey Prokopenko, Damien Lebrun-Grandié:
Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal. CoRR abs/2402.00665 (2024) - [i5]Andrey Prokopenko, Daniel Arndt, Damien Lebrun-Grandié, Bruno Turcksin, Nicholas Frontiere, J. D. Emberson, Michael Buehlmann:
Advances in ArborX to support exascale applications. CoRR abs/2409.10743 (2024) - 2023
- [c5]Carl Pearson, Christopher M. Siefert, Stephen L. Olivier, Andrey Prokopenko, Timothy J. Fuller, Jonathan J. Hu:
Latency and Bandwidth Microbenchmarks of Six US Department of Energy Systems in the Top500. CLUSTER Workshops 2023: 52-53 - [c4]Andrey Prokopenko, Damien Lebrun-Grandié, Daniel Arndt:
Fast tree-based algorithms for DBSCAN for low-dimensional data on GPUs. ICPP 2023: 503-512 - [c3]Christopher M. Siefert, Carl Pearson, Stephen L. Olivier, Andrey Prokopenko, Jonathan J. Hu, Timothy J. Fuller:
Latency and Bandwidth Microbenchmarks of US Department of Energy Systems in the June 2023 Top 500 List. SC Workshops 2023: 1298-1305 - 2022
- [c2]Andrey Prokopenko, Piyush Sao, Damien Lebrun-Grandié:
A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs. ICPP 2022: 14:1-14:10 - [i4]Andrey Prokopenko, Piyush Sao, Damien Lebrun-Grandié:
A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs. CoRR abs/2207.00514 (2022) - 2021
- [j4]Damien Lebrun-Grandié, Andrey Prokopenko, Bruno Turcksin, Stuart R. Slattery:
ArborX: A Performance Portable Geometric Search Library. ACM Trans. Math. Softw. 47(1): 2:1-2:15 (2021) - [i3]Andrey Prokopenko, Damien Lebrun-Grandié, Daniel Arndt:
Fast tree-based algorithms for DBSCAN on GPUs. CoRR abs/2103.05162 (2021) - 2020
- [j3]Seth R. Johnson, Andrey Prokopenko, Katherine J. Evans, Jeffrey C. Carver, Karla Morris:
Automated Fortran-C++ Bindings for Large-Scale Scientific Applications. Comput. Sci. Eng. 22(5): 84-94 (2020)
2010 – 2019
- 2019
- [i2]Seth R. Johnson, Andrey Prokopenko, Katherine J. Evans:
Automated Fortran-C++ Bindings for Large-Scale Scientific Applications. CoRR abs/1904.02546 (2019) - [i1]Damien Lebrun-Grandié, Andrey Prokopenko, Bruno Turcksin, Stuart R. Slattery:
ArborX: A Performance Portable Search Library. CoRR abs/1908.11807 (2019) - 2017
- [j2]Andrey Prokopenko, Raymond S. Tuminaro:
An algebraic multigrid method for Q2-Q1 mixed discretizations of the Navier-Stokes equations. Numer. Linear Algebra Appl. 24(6) (2017) - 2014
- [j1]Paul T. Lin, Matthew T. Bettencourt, Stefan Domino, Travis Fisher, Mark Hoemmen, Jonathan J. Hu, Eric T. Phipps, Andrey Prokopenko, Sivasankaran Rajamanickam, Christopher M. Siefert, Stephen Kennon:
Towards Extreme-Scale Simulations for Low Mach Fluids with Second-Generation Trilinos. Parallel Process. Lett. 24(4) (2014) - [c1]Paul T. Lin, Matthew T. Bettencourt, Stefan Domino, Travis Fisher, Mark Hoemmen, Jonathan J. Hu, Eric T. Phipps, Andrey Prokopenko, Sivasankaran Rajamanickam, Christopher M. Siefert, Eric C. Cyr, Stephen Kennon:
Towards Extreme-Scale Simulations with Next-Generation Trilinos: A Low Mach Fluid Application Case Study. IPDPS Workshops 2014: 1485-1494
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-15 20:42 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:
