On the public citation graph
Work-Efficient Parallel GPU Methods for Single-Source Shortest Paths
0 signed · 203 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/b978-0-12-811986-0.00033-9openalex-snapshot
THRUST: a productivity-oriented library for CUDA
inferredcites →https://doi.org/10.1016/j.jpdc.2012.02.007openalex-snapshot
PHAST: Hardware-accelerated shortest path trees
inferredcites →https://doi.org/10.1016/s0196-6774(03)00076-2openalex-snapshot
Δ-stepping: a parallelizable shortest path algorithm
inferredcites →https://doi.org/10.1109/iiswc.2012.6402918openalex-snapshot
A quantitative study of irregular programs on GPUs
inferredcites →https://doi.org/10.1109/ispass.2009.4919639openalex-snapshot
Lonestar: A suite of parallel irregular programs
inferredcites →https://doi.org/10.1109/tvcg.2010.88openalex-snapshot
Memory-Scalable GPU Spatial Hierarchy Construction
inferredcites →https://doi.org/10.1137/1.9781611972863.13openalex-snapshot
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
inferredcites →https://doi.org/10.1137/1.9781611972887.9openalex-snapshot
Better Approximation of Betweenness Centrality
inferredcites →https://doi.org/10.1145/1654059.1654078openalex-snapshot
Implementing sparse matrix-vector multiplication on throughput-oriented processors
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.1145/2517349.2522739openalex-snapshot
A lightweight infrastructure for graph analytics
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4064openalex-snapshot
Efficient and high‐quality sparse graph coloring on GPUs
inferred← citeshttps://doi.org/10.1007/978-3-030-22475-2_3openalex-snapshot
Distributed Single-Source Shortest Path Algorithms with Two-Dimensional Graph Layout
inferred← citeshttps://doi.org/10.1007/978-3-030-38991-8_14openalex-snapshot
Impromptu Rendezvous Based Multi-threaded Algorithm for Shortest Lagrangian Path Problem on Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-032-06751-7_16openalex-snapshot
Calculating the Optimal Number of Parallel Processes for Data-Parallel Algorithm Optimization
inferred← citeshttps://doi.org/10.1007/978-3-032-31390-4_26openalex-snapshot
GPU-Parallel Alternatives for Traffic Assignment
inferred← citeshttps://doi.org/10.1007/978-3-319-09873-9_61openalex-snapshot
Customizing Driving Directions with GPUs
inferred← citeshttps://doi.org/10.1007/978-3-319-61982-8_10openalex-snapshot
A Data Parallel Algorithm for Seismic Raytracing
inferred← citeshttps://doi.org/10.1007/978-3-319-68953-1_5openalex-snapshot
Locality-Based Relaxation: An Efficient Method for GPU-Based Computation of Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-3-319-73814-7_5openalex-snapshot
Parallelizing Single Source Shortest Path with OpenSHMEM
inferred← citeshttps://doi.org/10.1007/978-3-319-96983-1_45openalex-snapshot
Efficient Load Balancing Techniques for Graph Traversal Applications on GPUs
inferred← citeshttps://doi.org/10.1007/978-981-13-3441-2_2openalex-snapshot
Scalable Single-Source Shortest Path Algorithms on Distributed Memory Systems
inferred← citeshttps://doi.org/10.1007/s10766-015-0351-zopenalex-snapshot
Comprehensive Evaluation of a New GPU-based Approach to the Shortest Path Problem
inferred← citeshttps://doi.org/10.1007/s10766-016-0448-zopenalex-snapshot
Programming GPGPU Graph Applications with Linear Algebra Building Blocks
inferred← citeshttps://doi.org/10.1007/s11227-017-2225-1openalex-snapshot
A survey of graph processing on graphics processing units
inferred← citeshttps://doi.org/10.1007/s11227-018-2654-5openalex-snapshot
On parallel computation of centrality measures of graphs
inferred← citeshttps://doi.org/10.1007/s11227-022-04621-1openalex-snapshot
Irregular accesses reorder unit: improving GPGPU memory coalescing for graph-based workloads
inferred← citeshttps://doi.org/10.1007/s11227-024-06079-9openalex-snapshot
Allok: a machine learning approach for efficient graph execution on CPU–GPU clusters
inferred← citeshttps://doi.org/10.1007/s11390-019-1914-zopenalex-snapshot
A Survey on Graph Processing Accelerators: Challenges and Opportunities
inferred← citeshttps://doi.org/10.1016/b978-0-12-803738-6.00007-0openalex-snapshot
Graph algorithms on GPUs
inferred← citeshttps://doi.org/10.1016/j.cad.2025.103948openalex-snapshot
Matrix representation and GPU-optimized parallel B-spline computing
inferred← citeshttps://doi.org/10.1016/j.csi.2024.103922openalex-snapshot
GSParLib: A multi-level programming interface unifying OpenCL and CUDA for expressing stream and data parallelism
inferred← citeshttps://doi.org/10.1016/j.future.2019.09.052openalex-snapshot
WolfGraph: The edge-centric graph processing on GPU
inferred← citeshttps://doi.org/10.1016/j.jclepro.2023.138420openalex-snapshot
Hierarchical eco-driving control for plug-in hybrid electric vehicles under multiple signalized intersection scenarios
inferred← citeshttps://doi.org/10.1016/j.parco.2017.11.001openalex-snapshot
Orchestrating parallel detection of strongly connected components on GPUs
inferred← citeshttps://doi.org/10.1016/j.trc.2019.05.020openalex-snapshot
A data-parallel many-source shortest-path algorithm to accelerate macroscopic transport network assignment
inferred← citeshttps://doi.org/10.1109/access.2026.3722936openalex-snapshot
Toward Computation-Efficient High-Quality Graph Coloring on GPUs
inferred← citeshttps://doi.org/10.1109/ccis.2018.8691206openalex-snapshot
Research on Optimizing Strategy of Database-oriented GIS Graph database Query
inferred← citeshttps://doi.org/10.1109/cgo51591.2021.9370321openalex-snapshot
Compiling Graph Applications for GPU s with GraphIt
inferred← citeshttps://doi.org/10.1109/cgo51591.2021.9370326openalex-snapshot
Efficient Execution of Graph Algorithms on CPU with SIMD Extensions
inferred← citeshttps://doi.org/10.1109/cgo53902.2022.9741280openalex-snapshot
GraphIt to CUDA Compiler in 2021 LOC: A Case for High-Performance DSL Implementation via Staging with BuilDSL
inferred← citeshttps://doi.org/10.1109/cse-euc-dcabes.2016.189openalex-snapshot
Towards Scaling Parallel Seismic Raytracing
inferred← citeshttps://doi.org/10.1109/hipc.2015.40openalex-snapshot
Efficient Batched Predecessor Search in Shared Memory on GPUs
inferred← citeshttps://doi.org/10.1109/hpca61900.2025.00108openalex-snapshot
SparseWeaver: Converting Sparse Operations as Dense Operations on GPUs for Graph Workloads
inferred← citeshttps://doi.org/10.1109/hpcs.2018.00042openalex-snapshot
Optimizing Agent-Based Simulations for the GPU
inferred← citeshttps://doi.org/10.1109/hpcs48598.2019.9188204openalex-snapshot
Configuring Graph Traversal Applications for GPUs: Analysis of Implementation Strategies and their Correlation with Graph Characteristics
inferred← citeshttps://doi.org/10.1109/hpec.2014.7040980openalex-snapshot
Optimizing energy consumption and parallel performance for static and dynamic betweenness centrality using GPUs
inferred← citeshttps://doi.org/10.1109/hpec.2016.7761622openalex-snapshot
cuSTINGER: Supporting dynamic graph algorithms for GPUs
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091058openalex-snapshot
Autonomous, independent management of dynamic graphs on GPUs
inferred← citeshttps://doi.org/10.1109/hpec.2019.8916366openalex-snapshot
Message Scheduling for Performant, Many-Core Belief Propagation
inferred← citeshttps://doi.org/10.1109/hpec43674.2020.9286141openalex-snapshot
Fast GPU Graph Contraction by Combining Efficient Shallow Searches and Post-Culling
inferred← citeshttps://doi.org/10.1109/icassp43922.2022.9747713openalex-snapshot
Parallel Composition of Weighted Finite-State Transducers
inferred← citeshttps://doi.org/10.1109/icct67417.2025.11374265openalex-snapshot
An Efficient Betweenness Centrality Algorithm Based on Sampling Strategy
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00246openalex-snapshot
GX-Plug: a Middleware for Plugging Accelerators to Distributed Graph Processing
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00022openalex-snapshot
Efficient Multi-GPU Graph Processing with Remote Work Stealing
inferred← citeshttps://doi.org/10.1109/iceca.2017.8212794openalex-snapshot
Parallel implementation of Bellman-ford algorithm using CUDA architecture
inferred← citeshttps://doi.org/10.1109/icpads.2015.10openalex-snapshot
Fast Execution of Simultaneous Breadth-First Searches on Sparse Graphs
inferred← citeshttps://doi.org/10.1109/icpads.2017.00082openalex-snapshot
An Analytical Study of Recursive Tree Traversal Patterns on Multi- and Many-Core Platforms
inferred← citeshttps://doi.org/10.1109/igsc48788.2019.8957183openalex-snapshot
Energy-Efficient GPU Graph Processing with On-Demand Page Migration
inferred← citeshttps://doi.org/10.1109/iiswc.2015.13openalex-snapshot
Performance Characterization of High-Level Programming Models for GPU Graph Analytics
inferred← citeshttps://doi.org/10.1109/iiswc.2016.7581278openalex-snapshot
GPU concurrency choices in graph analytics
inferred← citeshttps://doi.org/10.1109/iiswc66894.2025.00030openalex-snapshot
ALPHA-PIM: Analysis of Linear Algebraic Processing for High-Performance Graph Applications on a Real Processing-In-Memory System
inferred← citeshttps://doi.org/10.1109/ipdps.2015.54openalex-snapshot
High-Performance Graph Analytics on Manycore Processors
inferred← citeshttps://doi.org/10.1109/ipdps.2016.106openalex-snapshot
Synchronization Trade-Offs in GPU Implementations of Graph Algorithms
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00117openalex-snapshot
An Energy-Efficient Single-Source Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00118openalex-snapshot
Scalable Breadth-First Search on a GPU Cluster
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00027openalex-snapshot
Scaling and Selecting GPU Methods for All Pairs Shortest Paths (APSP) Computations
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00056openalex-snapshot
Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Graph Processing on GPU
inferred← citeshttps://doi.org/10.1109/ipdpsw.2015.77openalex-snapshot
Fast Sparse Matrix and Sparse Vector Multiplication Algorithm on the GPU
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.185openalex-snapshot
GBTL-CUDA: Graph Algorithms and Primitives for GPUs
inferred← citeshttps://doi.org/10.1109/ipdpsw71298.2026.00077openalex-snapshot
Efficient Communication-Aware Distributed ∆-Stepping for Single-Source Shortest Paths
inferred← citeshttps://doi.org/10.1109/iros.2018.8594054openalex-snapshot
GPU-Accelerated Next-Best-View Coverage of Articulated Scenes
inferred← citeshttps://doi.org/10.1109/isca.2016.24openalex-snapshot
Energy Efficient Architecture for Graph Analytics Accelerators
inferred← citeshttps://doi.org/10.1109/isca52012.2021.00041openalex-snapshot
Taming the Zoo: The Unified GraphIt Compiler Framework for Novel Architectures
inferred← citeshttps://doi.org/10.1109/iscas56072.2025.11043988openalex-snapshot
A Digital Neuromorphic Architecture for Unsupervised Shortest Path Computation on Real-World Graphs
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-sustaincom-socialcom48970.2019.00191openalex-snapshot
Architectural Implications in Graph Processing of Accelerator with Gardenia Benchmark Suite
inferred← citeshttps://doi.org/10.1109/ispass69572.2026.00030openalex-snapshot
A Heterogeneous Mapping of a Speech Neuroprosthesis Application
inferred← citeshttps://doi.org/10.1109/kbei.2017.8324901openalex-snapshot
Efficient implementation of the Bellman-Ford algorithm on GPU
inferred← citeshttps://doi.org/10.1109/mascots.2017.15openalex-snapshot
Performance Evaluation of Priority Queues for Fine-Grained Parallel Tasks on GPUs
inferred← citeshttps://doi.org/10.1109/mcsoc.2015.15openalex-snapshot
On the Load Balancing Techniques for GPU Applications Based on Prefix-Scan
inferred← citeshttps://doi.org/10.1109/pact.2015.15openalex-snapshot
Scalable SIMD-Efficient Graph Processing on GPUs
inferred← citeshttps://doi.org/10.1109/pact.2015.18openalex-snapshot
Parallel Methods for Verifying the Consistency of Weakly-Ordered Architectures
inferred← citeshttps://doi.org/10.1109/pact.2017.48openalex-snapshot
MultiGraph: Efficient Graph Processing on GPUs
inferred← citeshttps://doi.org/10.1109/pdp.2016.76openalex-snapshot
Computing Multiple Accumulated Cost Surfaces with Graphics Processing Units
inferred← citeshttps://doi.org/10.1109/pdp2018.2018.00035openalex-snapshot
Stingray-HPC: A Scalable Parallel Seismic Raytracing System
inferred← citeshttps://doi.org/10.1109/pdp59025.2023.00013openalex-snapshot
Automatic CPU-GPU Allocation for Graph Execution
inferred← citeshttps://doi.org/10.1109/pic.2017.8359560openalex-snapshot
Specialization or generalization: A study on breadth-first graph traversal on GPUs
inferred← citeshttps://doi.org/10.1109/ri2c60382.2023.10355995openalex-snapshot
A Case Study of an Adaptive Delta-Stepping Algorithm in OpenMP
inferred← citeshttps://doi.org/10.1109/sc.2014.52openalex-snapshot
Scalable and High Performance Betweenness Centrality on the GPU
inferred← citeshttps://doi.org/10.1109/sc.2018.00063openalex-snapshot
faimGraph: High Performance Management of Fully-Dynamic Graphs Under Tight Memory Constraints on the GPU
inferred← citeshttps://doi.org/10.1109/sibgrapi.2015.44openalex-snapshot
Real-Time Local Unfolding for Agents Navigation on Arbitrary Surfaces
inferred← citeshttps://doi.org/10.1109/sies.2017.7993387openalex-snapshot
A performance, power, and energy efficiency analysis of load balancing techniques for GPUs
inferred← citeshttps://doi.org/10.1109/soca.2017.15openalex-snapshot
Puffin: Graph Processing System on Multi-GPUs
inferred← citeshttps://doi.org/10.1109/tc.2021.3104749openalex-snapshot
Energy-Efficient Stream Compaction Through Filtering and Coalescing Accesses in GPGPU Memory Partitions
inferred← citeshttps://doi.org/10.1109/tpds.2015.2485994openalex-snapshot
An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures
inferred← citeshttps://doi.org/10.1109/tpds.2016.2631166openalex-snapshot
A Dynamic Approach for Workload Partitioning on GPU Architectures
inferred← citeshttps://doi.org/10.1109/tpds.2018.2885745openalex-snapshot
Exploring GPU-Accelerated Routing for FPGAs
inferred← citeshttps://doi.org/10.1109/tpds.2025.3563849openalex-snapshot
Parallel Greedy Algorithms for Steiner Forest
inferred← citeshttps://doi.org/10.1145/2688500.2688538openalex-snapshot
Gunrock: a high-performance graph processing library on the GPU
inferred← citeshttps://doi.org/10.1145/2808091.2808092openalex-snapshot
Meta-programming and auto-tuning in the search for high performance GPU code
inferred← citeshttps://doi.org/10.1145/2833179.2833189openalex-snapshot
Dynamic parallelism for simple and efficient GPU graph algorithms
inferred← citeshttps://doi.org/10.1145/2903150.2911712openalex-snapshot
An energy-efficient parallel algorithm for real-time near-optimal UAV path planning
inferred← citeshttps://doi.org/10.1145/2983990.2984015openalex-snapshot
A compiler for throughput optimization of graph algorithms on GPUs
inferred← citeshttps://doi.org/10.1145/3007787.3001155openalex-snapshot
Energy efficient architecture for graph analytics accelerators
inferred← citeshttps://doi.org/10.1145/3022671.2984015openalex-snapshot
A compiler for throughput optimization of graph algorithms on GPUs
inferred← citeshttps://doi.org/10.1145/3026937.3026941openalex-snapshot
High Performance Detection of Strongly Connected Components in Sparse Graphs on GPUs
inferred← citeshttps://doi.org/10.1145/3106237.3106265openalex-snapshot
Cooperative kernels: GPU multitasking for blocking algorithms
inferred← citeshttps://doi.org/10.1145/3149704.3149764openalex-snapshot
Parallel Depth-First Search for Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1145/3225058.3225075openalex-snapshot
An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores
inferred← citeshttps://doi.org/10.1145/3230485openalex-snapshot
Accelerating GPU betweenness centrality
inferred← citeshttps://doi.org/10.1145/3290688.3290707openalex-snapshot
Efficient GPU Stream Transform
inferred← citeshttps://doi.org/10.1145/3293883.3295716openalex-snapshot
A pattern based algorithmic autotuner for graph processing on GPUs
inferred← citeshttps://doi.org/10.1145/3300053.3319416openalex-snapshot
Which Graph Representation to Select for Static Graph-Algorithms on a CUDA-capable GPU
inferred← citeshttps://doi.org/10.1145/3302516.3307352openalex-snapshot
GPU-accelerated fixpoint algorithms for faster compiler analyses
inferred← citeshttps://doi.org/10.1145/3330345.3330368openalex-snapshot
GPU road network graph contraction and SSSP query
inferred← citeshttps://doi.org/10.1145/3366428.3380772openalex-snapshot
Custom code generation for a graph DSL
inferred← citeshttps://doi.org/10.1145/3409964.3461782openalex-snapshot
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
inferred← citeshttps://doi.org/10.1145/3437801.3441605openalex-snapshot
A fast work-efficient SSSP algorithm for GPUs
inferred← citeshttps://doi.org/10.1145/3466795openalex-snapshot
GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
inferred← citeshttps://doi.org/10.1145/3545008.3545056openalex-snapshot
Atos: A Task-Parallel GPU Scheduler for Graph Analytics
inferred← citeshttps://doi.org/10.1145/3559009.3569686openalex-snapshot
Decoupling Schedule, Topology Layout, and Algorithm to Easily Enlarge the Tuning Space of GPU Graph Processing
inferred← citeshttps://doi.org/10.1145/3570638openalex-snapshot
Optimization Techniques for GPU Programming
inferred← citeshttps://doi.org/10.1145/3572848.3577434openalex-snapshot
A Programming Model for GPU Load Balancing
inferred← citeshttps://doi.org/10.1145/3577193.3593728openalex-snapshot
Fast All-Pairs Shortest Paths Algorithm in Large Sparse Graph
inferred← citeshttps://doi.org/10.1145/3581784.3607038openalex-snapshot
Choosing the Best Parallelization and Implementation Styles for Graph Analytics Codes: Lessons Learned from 1106 Programs
inferred← citeshttps://doi.org/10.1145/3605731.3605746openalex-snapshot
A Bucket-aware Asynchronous Single-Source Shortest Path Algorithm on GPU
inferred← citeshttps://doi.org/10.1145/3626202.3637573openalex-snapshot
GraFlex: Flexible Graph Processing on FPGAs through Customized Scalable Interconnection Network
inferred← citeshttps://doi.org/10.1145/3650200.3656600openalex-snapshot
DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted Graphs
inferred← citeshttps://doi.org/10.1145/3652579openalex-snapshot
Machine Learning-Based Kernel Selector for SpMV Optimization in Graph Analysis
inferred← citeshttps://doi.org/10.1145/3654982openalex-snapshot
uBlade: Efficient Batch Processing for Uncertainty Graph Queries
inferred← citeshttps://doi.org/10.1145/3711708.3723447openalex-snapshot
Hyb-Stepping: Hybrid Stepping for Parallel Shortest Paths
inferred← citeshttps://doi.org/10.1145/3712285.3759872openalex-snapshot
Wasp: Efficient Asynchronous Single-Source Shortest Path on Multicore Systems via Work Stealing
inferred← citeshttps://doi.org/10.1145/3769792openalex-snapshot
Fast Optimal Group Steiner Tree Search using GPUs
inferred← citeshttps://doi.org/10.1145/3774934.3786461openalex-snapshot
ROME: Maximizing GPU Efficiency for All-Pairs Shortest Path via Taming Fine-Grained Irregularities
inferred← citeshttps://doi.org/10.1145/3789237.3809122openalex-snapshot
GASP: GPU-Accelerated Shortest Path for Graph Analytics
inferred← citeshttps://doi.org/10.1145/3797905.3805620openalex-snapshot
Parallel Bidirectional A* Search for GPU-Accelerated Pathfinding
inferred← citeshttps://doi.org/10.1155/2021/6639008openalex-snapshot
DMGA: A Distributed Shortest Path Algorithm for Multistage Graph
inferred← citeshttps://doi.org/10.14778/3151113.3151121openalex-snapshot
Parallel personalized pagerank on dynamic graphs
inferred← citeshttps://doi.org/10.14778/3151113.3151122openalex-snapshot
Accelerating dynamic graph analytics on GPUs
inferred← citeshttps://doi.org/10.14778/3380750.3380758openalex-snapshot
Data-parallel query processing on non-uniform data
inferred← citeshttps://doi.org/10.14778/3384345.3384358openalex-snapshot
Traversing large graphs on GPUs with unified memory
inferred← citeshttps://doi.org/10.14778/3436905.3436914openalex-snapshot
Accelerating exact constrained shortest paths on GPUs
inferred← citeshttps://doi.org/10.1587/transfun.2025vlp0009openalex-snapshot
Nested-Pipeline Delta-Stepping Scalable FPGA Accelerator for Parallel Single-Source Shortest Path with High-Level Synthesis
inferred← citeshttps://doi.org/10.17148/ijarcce.2017.65124openalex-snapshot
A Review: Parallel Implementation of Shortest path Algorithm on GPGPU
inferred← citeshttps://doi.org/10.17485/ijst/2016/v9i33/87795openalex-snapshot
Modified Dijkstra’s Algorithm for Dense Graphs on GPU using CUDA
inferred← citeshttps://doi.org/10.23919/ecc51009.2020.9143743openalex-snapshot
A generalized Bellman-Ford Algorithm for Application in Symbolic Optimal Control
inferred← citeshttps://doi.org/10.25560/68006openalex-snapshot
Inter-workgroup barrier synchronisation on graphics processing units
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.5104openalex-snapshot
Shortest Path Calculation Using Contraction Hierarchy Graph Algorithms on Nvidia GPUs
inferred← citeshttps://doi.org/10.32657/10356/72092openalex-snapshot
GPU-based commonsense reasoning for real-time query answering and multimodal analysis
inferred← citeshttps://doi.org/10.32657/10356/72409openalex-snapshot
Optimized GPU algorithms for sparse data problems
inferred← citeshttps://doi.org/10.4236/jcc.2015.38005openalex-snapshot
Improving Global Performance on GPU for Algorithms with Main Loop Containing a Reduction Operation: Case of Dijkstra’s Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1312.3018openalex-snapshot
Efficient Large-Scale Graph Processing on Hybrid CPU and GPU Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1503.07241openalex-snapshot
GraphMat: High performance graph analytics made productive
inferred← citeshttps://doi.org/10.48550/arxiv.1701.01170openalex-snapshot
Gunrock: GPU Graph Analytics
inferred← citeshttps://doi.org/10.48550/arxiv.1701.01189openalex-snapshot
GPU Multisplit: an extended study of a parallel algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1707.01989openalex-snapshot
Cooperative Kernels: GPU Multitasking for Blocking Algorithms (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1709.05061openalex-snapshot
Technical Report: Accelerating Dynamic Graph Analytics on GPUs
inferred← citeshttps://doi.org/10.48550/arxiv.1904.02241openalex-snapshot
GraphCage: Cache Aware Graph Processing on GPUs
inferred← citeshttps://doi.org/10.48550/arxiv.2012.07990openalex-snapshot
Compilation Techniques for Graph Algorithms on GPUs
inferred← citeshttps://doi.org/10.48550/arxiv.2112.00132openalex-snapshot
Atos: A Task-Parallel GPU Dynamic Scheduling Framework for Dynamic Irregular Computations
inferred← citeshttps://doi.org/10.5120/16667-6659openalex-snapshot
Parallel Implementations for Solving Shortest Path Problem using Bellman-Ford
inferred← citeshttps://doi.org/10.5120/17347-7360openalex-snapshot
A Fine Tuned Hybrid Implementation for Solving Shortest Path Problems using Bellman Ford
inferred← citeshttps://doi.org/10.5120/ijca2015906305openalex-snapshot
Comparative Analysis of Floyd Warshall and Dijkstras Algorithm using Opencl
inferred← citeshttps://doi.org/10.5120/ijca2016909305openalex-snapshot
Cache Friendly Bellman-Ford algorithm using OpenCL
inferred← citeshttps://doi.org/10.5120/ijca2018916948openalex-snapshot
A Comparative Study on Analysis of Various Shortest Path Algorithms on GPU using OPENCL
inferred← citeshttps://doi.org/10.5753/wscad.2022.226395openalex-snapshot
Decidindo entre GPU e CPU para Processar Grafos com Base em Metricas de Alto Nível
inferred← citeshttps://doi.org/10.5821/dissertation-2117-344358openalex-snapshot
High-performance and energy-efficient irregular graph processing on GPU architectures
inferred← citeshttps://doi.org/10.70675/a2b817dbz8bf4z40fdz8bafz0d1a77d57f36openalex-snapshot
Le choix des architectures hybrides, une stratégie réaliste pour atteindre l'échelle exaflopique.
inferred← citeshttps://doi.org/10.7287/peerj-cs.140v0.1/reviews/1openalex-snapshot
Peer Review #1 of "A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.140v0.1/reviews/2openalex-snapshot
Peer Review #2 of "A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.140v0.1/reviews/3openalex-snapshot
Peer Review #3 of "A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.140v0.2/reviews/1openalex-snapshot
Peer Review #1 of "A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.140v0.2/reviews/2openalex-snapshot
Peer Review #2 of "A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.140v0.2/reviews/3openalex-snapshot
Peer Review #3 of "A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks (v0.2)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.140openalex-snapshot
A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.