On the public citation graph
Computing Strongly Connected Components in Parallel on CUDA
0 signed · 110 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/11602569_48openalex-snapshot
Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors
inferredcites →https://doi.org/10.1007/11804192_13openalex-snapshot
Cluster-Based LTL Model Checking of Large Systems
inferredcites →https://doi.org/10.1007/3-540-45319-9_29openalex-snapshot
Is There a Best Symbolic Cycle-Detection Algorithm?
inferredcites →https://doi.org/10.1007/3-540-45591-4_68openalex-snapshot
On Identifying Strongly Connected Components in Parallel
inferredcites →https://doi.org/10.1007/978-3-540-70952-7_22openalex-snapshot
Parallel Algorithms for Finding SCCs in Implicitly Given Graphs
inferredcites →https://doi.org/10.1007/978-3-540-73370-6_13openalex-snapshot
Scalable Multi-core LTL Model-Checking
inferredcites →https://doi.org/10.1007/978-3-540-77220-0_21openalex-snapshot
Accelerating Large Graph Algorithms on the GPU Using CUDA
inferredcites →https://doi.org/10.1016/0020-0190(85)90024-9openalex-snapshot
Depth-first search is inherently sequential
inferredcites →https://doi.org/10.1016/0020-0190(88)90164-0openalex-snapshot
An improved parallel algorithm that computes the BFS numbering of a directed graph
inferredcites →https://doi.org/10.1016/0020-0190(93)90017-4openalex-snapshot
Improved processor bounds for parallel algorithms for weighted directed graphs
inferredcites →https://doi.org/10.1016/0890-5401(89)90036-9openalex-snapshot
Faster optimal parallel prefix sums and list ranking
inferredcites →https://doi.org/10.1016/j.entcs.2008.02.001openalex-snapshot
Improved Distributed Algorithms for SCC Decomposition
inferredcites →https://doi.org/10.1016/j.jpdc.2005.03.007openalex-snapshot
Finding strongly connected components in distributed graphs
inferredcites →https://doi.org/10.1049/cce:19910064openalex-snapshot
Vector Models for Data-Parallel Computing
inferredcites →https://doi.org/10.1093/logcom/exp003openalex-snapshot
Distributed Algorithms for SCC Decomposition
inferredcites →https://doi.org/10.1109/icpads.2010.82openalex-snapshot
Employing Multiple CUDA Devices to Accelerate LTL Model Checking
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot
R-MAT: A Recursive Model for Graph Mining
inferredcites →https://doi.org/10.1145/1378533.1378560openalex-snapshot
Finding strongly connected components in parallel using O (log 2 n ) reachability queries
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.1002/cpe.4164openalex-snapshot
A task‐based approach for finding SCCs in real‐world graphs on external memory
inferred← citeshttps://doi.org/10.1007/978-3-030-22747-0_2openalex-snapshot
Parallel Strongly Connected Components Detection with Multi-partition on GPUs
inferred← citeshttps://doi.org/10.1007/978-3-030-60245-1_3openalex-snapshot
Parallel SCC Detection Based on Reusing Warps and Coloring Partitions on GPUs
inferred← citeshttps://doi.org/10.1007/978-3-030-72013-1_4openalex-snapshot
Symbolic Coloured SCC Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-031-13324-4_12openalex-snapshot
LSL3D: A Run-Based Connected Component Labeling Algorithm for 3D Volumes
inferred← citeshttps://doi.org/10.1007/978-3-032-34896-8_27openalex-snapshot
GPU-Accelerated Dependency Graph Construction and Conflict Analysis for Preventing Read-Only Anomalies
inferred← citeshttps://doi.org/10.1007/978-3-319-04099-8_8openalex-snapshot
Parallel Computation of Nearly Recurrent Components of Piecewise Constant Vector Fields
inferred← citeshttps://doi.org/10.1007/978-3-319-07782-6_5openalex-snapshot
Implementing the Matrix Inversion by Gauss-Jordan Method with CUDA
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_20openalex-snapshot
GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components
inferred← citeshttps://doi.org/10.1007/978-3-319-27308-2_44openalex-snapshot
Accelerating Minimum Spanning Forest Computations on Multicore Platforms
inferred← citeshttps://doi.org/10.1007/978-3-319-58943-5_42openalex-snapshot
Parametric Multi-step Scheme for GPU-Accelerated Graph Decomposition into Strongly Connected Components
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_12openalex-snapshot
Parallel Model Checking Algorithms for Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-71255-0_7openalex-snapshot
The Comparison of Large-Scale Graph Processing Algorithms Implementation Methods for Intel KNL and NVIDIA GPU
inferred← citeshttps://doi.org/10.1007/978-3-642-31125-3_3openalex-snapshot
Parallel Algorithm for Landform Attributes Representation on Multicore and Multi-GPU Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31759-0_8openalex-snapshot
On Parallel Software Verification Using Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-38874-3_3openalex-snapshot
Model Checking of Biological Systems
inferred← citeshttps://doi.org/10.1007/s10009-015-0379-9openalex-snapshot
Many-core on-the-fly model checking of safety properties using GPUs
inferred← citeshttps://doi.org/10.1007/s10703-016-0246-7openalex-snapshot
Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
inferred← citeshttps://doi.org/10.1007/s10766-021-00723-0openalex-snapshot
Accelerating Computation of Steiner Trees on GPUs
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/s13278-020-00680-5openalex-snapshot
A numerical evaluation of the accuracy of influence maximization algorithms
inferred← citeshttps://doi.org/10.1016/j.ijar.2019.12.001openalex-snapshot
Finding strongly connected components of simple digraphs based on granulation strategy
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.10.015openalex-snapshot
Designing fast LTL model checking algorithms for many-core GPUs
inferred← citeshttps://doi.org/10.1016/j.knosys.2018.02.038openalex-snapshot
Finding strongly connected components of simple digraphs based on generalized rough sets theory
inferred← citeshttps://doi.org/10.1016/j.mfglet.2017.12.001openalex-snapshot
Surface defect identification and measurement for metal castings by vision system
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.procs.2012.04.006openalex-snapshot
Heterogeneous Computational Model for Landform Attributes Representation on Multicore and Multi-GPU Systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2013.10.014openalex-snapshot
Efficient decomposition of strongly connected components on GPUs
inferred← citeshttps://doi.org/10.1093/logcom/exad033openalex-snapshot
Constraint propagation on GPU: A case study for the AllDifferent constraint
inferred← citeshttps://doi.org/10.1109/cgo57630.2024.10444817openalex-snapshot
Representing Data Collections in an SSA Form
inferred← citeshttps://doi.org/10.1109/dasip.2018.8596835openalex-snapshot
A new Direct Connected Component Labeling and Analysis Algorithms for GPUs
inferred← citeshttps://doi.org/10.1109/fit47737.2019.00062openalex-snapshot
Heterogeneous 2-Phase Method for Strongly Connected Components Detection and Classification of Graphs
inferred← citeshttps://doi.org/10.1109/hipc.2013.6799110openalex-snapshot
Accelerating inclusion-based pointer analysis on heterogeneous CPU-GPU systems
inferred← citeshttps://doi.org/10.1109/hpcc-smartcity-dss.2016.0037openalex-snapshot
Composable Locality Optimizations for Accelerating Parallel Forest Computations
inferred← citeshttps://doi.org/10.1109/icassp39728.2021.9413653openalex-snapshot
Taming Voting Algorithms on Gpus for an Efficient Connected Component Analysis Algorithm
inferred← citeshttps://doi.org/10.1109/icpp.2015.107openalex-snapshot
Nested Parallelism on GPU: Exploring Parallelization Templates for Irregular Loops and Recursive Computations
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.2013.101openalex-snapshot
Deploying Graph Algorithms on GPUs: An Adaptive Solution
inferred← citeshttps://doi.org/10.1109/ipdps.2014.64openalex-snapshot
BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00032openalex-snapshot
Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.108openalex-snapshot
Counting Triangles in Large Graphs on GPU
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.11openalex-snapshot
High Performance Parallel Graph Coloring on GPGPUs
inferred← citeshttps://doi.org/10.1109/iscas45731.2020.9181251openalex-snapshot
MG-Hybrid: A Strongly Connected Components Detection Algorithm using Multiple GPUs
inferred← citeshttps://doi.org/10.1109/ispdc.2016.15openalex-snapshot
Finding SCCs in Real-World Graphs on External Memory: A Task-Based Approach
inferred← citeshttps://doi.org/10.1109/micro.2014.24openalex-snapshot
Accelerating Irregular Algorithms on GPGPUs Using Fine-Grain Hardware Worklists
inferred← citeshttps://doi.org/10.1109/nas.2012.12openalex-snapshot
Implementing the Jacobi Algorithm for Solving Eigenvalues of Symmetric Matrices with CUDA
inferred← citeshttps://doi.org/10.1109/padsw.2014.7097806openalex-snapshot
GRapid: A compilation and runtime framework for rapid prototyping of graph applications on many-core processors
inferred← citeshttps://doi.org/10.1109/tase52547.2021.00016openalex-snapshot
A Parallel Implementation of Liveness on Knowledge Graphs under Label Constraints
inferred← citeshttps://doi.org/10.1109/tip.2022.3187563openalex-snapshot
Hierarchical Superpixel Segmentation by Parallel CRTrees Labeling
inferred← citeshttps://doi.org/10.1109/tpds.2013.41openalex-snapshot
IMGPU: GPU-Accelerated Influence Maximization in Large-Scale Social Networks
inferred← citeshttps://doi.org/10.1109/tpds.2015.2397933openalex-snapshot
An Efficient GPU Implementation of Inclusion-Based Pointer Analysis
inferred← citeshttps://doi.org/10.1109/wscad-ssc.2012.12openalex-snapshot
Auto-Tuning Methodology to Represent Landform Attributes on Multicore and Multi-GPU Systems
inferred← citeshttps://doi.org/10.1145/2145816.2145831openalex-snapshot
A GPU implementation of inclusion-based points-to analysis
inferred← citeshttps://doi.org/10.1145/2370036.2145831openalex-snapshot
A GPU implementation of inclusion-based points-to analysis
inferred← citeshttps://doi.org/10.1145/2442992.2443006openalex-snapshot
Auto-tuning methodology to represent landform attributes on multicore and multi-GPU systems
inferred← citeshttps://doi.org/10.1145/2503210.2503246openalex-snapshot
On fast parallel detection of strongly connected components (SCC) in small-world graphs
inferred← citeshttps://doi.org/10.1145/2851141.2851161openalex-snapshot
Multi-core on-the-fly SCC decomposition
inferred← citeshttps://doi.org/10.1145/2884045.2884048openalex-snapshot
GPU centric extensions for parallel strongly connected components computation
inferred← citeshttps://doi.org/10.1145/2935764.2935766openalex-snapshot
Parallelism in Randomized Incremental Algorithms
inferred← citeshttps://doi.org/10.1145/3016078.2851161openalex-snapshot
Multi-core on-the-fly SCC decomposition
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/3299869.3319871openalex-snapshot
GPU-based Graph Traversal on Compressed Graphs
inferred← citeshttps://doi.org/10.1145/3303117.3306164openalex-snapshot
Designing efficient SIMD algorithms for direct Connected Component Labeling
inferred← citeshttps://doi.org/10.1145/3402819openalex-snapshot
Parallelism in Randomized Incremental Algorithms
inferred← citeshttps://doi.org/10.1145/3448016.3457279openalex-snapshot
Self-adaptive Graph Traversal on GPUs
inferred← citeshttps://doi.org/10.1145/3528416.3530247openalex-snapshot
Efficient trimming for strongly connected components calculation
inferred← citeshttps://doi.org/10.1145/3543542openalex-snapshot
i S pan : Parallel Identification of Strongly Connected Components with Spanning Trees
inferred← citeshttps://doi.org/10.1145/3570638openalex-snapshot
Optimization Techniques for GPU Programming
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/3581784.3607071openalex-snapshot
A GPU Algorithm for Detecting Strongly Connected Components
inferred← citeshttps://doi.org/10.1145/3589259openalex-snapshot
Parallel Strong Connectivity Based on Faster Reachability
inferred← citeshttps://doi.org/10.1145/3694906.3743350openalex-snapshot
A Deterministic Work-Depth Tradeoff for Strongly Connected Components
inferred← citeshttps://doi.org/10.12733/jics20101591openalex-snapshot
Parallel and Complete Model Checking with Linear Complexity
inferred← citeshttps://doi.org/10.14778/2732286.2732294openalex-snapshot
Optimizing graph algorithms on pregel-like systems
inferred← citeshttps://doi.org/10.17877/de290r-3335openalex-snapshot
Large scale parallel state space search utilizing graphics processing units and solid state disks
inferred← citeshttps://doi.org/10.18287/2412-6179-2019-43-3-446-454openalex-snapshot
GPU acceleration of edge detection algorithm based on local variance and integral image: application to air bubbles boundaries extraction
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.3990/1.9789036547864openalex-snapshot
Strong connectivity and shortest paths for checking models
inferred← citeshttps://doi.org/10.4204/eptcs.72.1openalex-snapshot
Platform Dependent Verification: On Engineering Verification Tools for 21st Century
inferred← citeshttps://doi.org/10.4204/eptcs.72.8openalex-snapshot
Computing Optimal Cycle Mean in Parallel on CUDA
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:38)2022openalex-snapshot
BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1701.01170openalex-snapshot
Gunrock: GPU Graph Analytics
inferred← citeshttps://doi.org/10.48550/arxiv.1810.05303openalex-snapshot
Parallelism in Randomized Incremental Algorithms
inferred← citeshttps://doi.org/10.70675/62ec1de1z4856z4b5dzb11ezc7022dbd7ff1openalex-snapshot
Performance optimization for the LHCb experiment
inferred← citeshttps://doi.org/10.7936/k73x84sgopenalex-snapshot
Modeling Algorithm Performance on Highly-threaded Many-core Architectures
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.