On the public citation graph
Distributed Algorithms for SCC Decomposition
0 signed · 59 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/11817963_26openalex-snapshot
DiVinE – A Tool for Distributed Verification
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/3-540-45657-0_50openalex-snapshot
State Space Reduction by Proving Confluence
inferredcites →https://doi.org/10.1007/3-540-48234-2_3openalex-snapshot
Distributed-Memory Model Checking with SPIN
inferredcites →https://doi.org/10.1007/3-540-60029-9_40openalex-snapshot
Parallel state space exploration for GSPN models
inferredcites →https://doi.org/10.1007/3-540-63166-6_26openalex-snapshot
Parallelizing the Murϕ verifier
inferredcites →https://doi.org/10.1007/978-3-540-30494-4_25openalex-snapshot
Accepting Predecessors Are Better than Back Edges in Distributed LTL Model-Checking
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-71209-1_53openalex-snapshot
Distributed Analysis with μCRL: A Compendium of Case Studies
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.1016/s1571-0661(05)80388-3openalex-snapshot
A Performance Study of Distributed Timed Automata Reachability Analysis
inferredcites →https://doi.org/10.1109/qest.2006.25openalex-snapshot
LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1287/ijoc.10.1.82openalex-snapshot
Distributed State Space Generation of Discrete-State Stochastic Models
inferredcites →https://doi.org/10.5555/380921.380941openalex-snapshot
Parallel state space construction for model-checking
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.6043openalex-snapshot
Toward a multilevel scalable parallel Zielonka's algorithm for solving parity games
inferred← citeshttps://doi.org/10.1007/978-3-030-17465-1_19openalex-snapshot
Digital Bifurcation Analysis of TCP Dynamics
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-19849-6_30openalex-snapshot
Exploring a Parallel SCC Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-031-30820-8_22openalex-snapshot
A Truly Symbolic Linear-Time Algorithm for SCC Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-319-67471-1_3openalex-snapshot
Detecting Attractors in Biological Models with Uncertain Parameters
inferred← citeshttps://doi.org/10.1007/978-3-319-96142-2_13openalex-snapshot
Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives
inferred← citeshttps://doi.org/10.1007/978-3-642-10373-5_22openalex-snapshot
Scalable Multi-core Model Checking Fairness Enhanced Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_14openalex-snapshot
Concurrent Depth-First Search Algorithms
inferred← citeshttps://doi.org/10.1007/s10009-015-0382-1openalex-snapshot
Concurrent depth-first search algorithms based on Tarjan’s Algorithm
inferred← citeshttps://doi.org/10.1007/s10115-024-02299-wopenalex-snapshot
Efficient parallel algorithm for finding strongly connected components based on granulation strategy
inferred← citeshttps://doi.org/10.1007/s10703-012-0180-2openalex-snapshot
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
inferred← citeshttps://doi.org/10.1007/s11227-014-1099-8openalex-snapshot
A BSP algorithm for on-the-fly checking CTL* formulas on security protocols
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.1063/1.4809783openalex-snapshot
Dynamical modeling and analysis of large cellular regulatory networks
inferred← citeshttps://doi.org/10.1109/icstcc.2018.8540762openalex-snapshot
Fully Automated Attractor Analysis of Cyanobacteria Models
inferred← citeshttps://doi.org/10.1109/ipdps.2011.59openalex-snapshot
Computing Strongly Connected Components in Parallel on CUDA
inferred← citeshttps://doi.org/10.1109/ispdc.2011.16openalex-snapshot
Adapting Active Objects to Multicore Architectures
inferred← citeshttps://doi.org/10.1109/ispdc.2012.10openalex-snapshot
A BSP Algorithm for On-the-fly Checking LTL Formulas on Security Protocols
inferred← citeshttps://doi.org/10.1109/tac.2022.3209446openalex-snapshot
A Scalable Distributed Dynamical Systems Approach to Learn the Strongly Connected Components and Diameter of Networks
inferred← citeshttps://doi.org/10.1142/s0218127420300384openalex-snapshot
Digital Bifurcation Analysis of Internet Congestion Control Protocols
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/3016078.2851161openalex-snapshot
Multi-core on-the-fly SCC decomposition
inferred← citeshttps://doi.org/10.1145/3589259openalex-snapshot
Parallel Strong Connectivity Based on Faster Reachability
inferred← citeshttps://doi.org/10.14778/2732286.2732294openalex-snapshot
Optimizing graph algorithms on pregel-like systems
inferred← citeshttps://doi.org/10.14794/icai.9.2014.2.113openalex-snapshot
Efficiency issues of computing graph properties of social networks
inferred← citeshttps://doi.org/10.26636/jtit.2024.3.1693openalex-snapshot
Increasing Parallelism in Forward-backward Distributed Algorithm for Finding Strongly Connected Components of Directed Graphs
inferred← citeshttps://doi.org/10.3390/math12111723openalex-snapshot
A Granulation Strategy-Based Algorithm for Computing Strongly Connected Components in Parallel
inferred← citeshttps://doi.org/10.3934/dcds.2015.35.4019openalex-snapshot
Computation of Lyapunov functions for systems with multiple local attractors
inferred← citeshttps://doi.org/10.3990/1.9789036528580openalex-snapshot
Diagnosis, synthesis and analysis of probabilistic models
inferred← citeshttps://doi.org/10.3990/1.9789036535861openalex-snapshot
Efficient simulation techniques for stochastic model checking
inferred← citeshttps://doi.org/10.3990/1.9789036547864openalex-snapshot
Strong connectivity and shortest paths for checking models
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:38)2022openalex-snapshot
BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs
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.