26 citations · 50 across the 5 of their papers we have counts for
5 papers
A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs
Andrey Prokopenko, Piyush Sao, Damien Lebrun-Grandié
Computing the Euclidean minimum spanning tree (EMST) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing…
Fast tree-based algorithms for DBSCAN for low-dimensional data on GPUs
Andrey Prokopenko, Damien Lebrun-Grandie, Daniel Arndt
DBSCAN is a well-known density-based clustering algorithm to discover arbitrary shape clusters. While conceptually simple in serial, the algorithm is challenging to efficiently par…
ArborX: A Performance Portable Geometric Search Library
D. Lebrun-Grandié, A. Prokopenko, B. Turcksin +1
Searching for geometric objects that are close in space is a fundamental component of many applications. The performance of search algorithms comes to the forefront as the size of…
Automated Fortran--C++ Bindings for Large-Scale Scientific Applications
Seth R. Johnson, Andrey Prokopenko, Katherine J. Evans
Although many active scientific codes use modern Fortran, most contemporary scientific software "libraries" are implemented in C and C++. Providing their numerical, algorithmic, or…
An algebraic multigrid method for mixed discretizations of the Navier-Stokes equations
Andrey Prokopenko, Raymond S. Tuminaro
Algebraic multigrid (AMG) preconditioners are considered for discretized systems of partial differential equations (PDEs) where unknowns associated with different physical quantiti…