Morph algorithms on GPUs
- 23 February 2013
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 48 (8), 147-156
- https://doi.org/10.1145/2517327.2442531
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- A yoke of oxen and a thousand chickens for heavy lifting graph processingPublished by Association for Computing Machinery (ACM) ,2012
- Computing 2D constrained Delaunay triangulation using the GPUPublished by Association for Computing Machinery (ACM) ,2012
- Scalable parallel minimum spanning forest computationPublished by Association for Computing Machinery (ACM) ,2012
- A GPU implementation of inclusion-based points-to analysisPublished by Association for Computing Machinery (ACM) ,2012
- Parallel Replication-Based Points-To AnalysisLecture Notes in Computer Science, 2012
- An Efficient CUDA Implementation of the Tree-Based Barnes Hut n-Body AlgorithmPublished by Elsevier BV ,2011
- Fully Generalized Two-Dimensional Constrained Delaunay Mesh RefinementSIAM Journal on Scientific Computing, 2010
- Optimistic parallelism requires abstractionsACM SIGPLAN Notices, 2007
- Triangle: Engineering a 2D quality mesh generator and Delaunay triangulatorLecture Notes in Computer Science, 1996
- A Parallel Graph Coloring HeuristicSIAM Journal on Scientific Computing, 1993