On the public citation graph
An Approach to Parallelize Kruskal's Algorithm Using Helper Threads
0 signed · 35 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/978-3-031-26212-8_4openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1016/j.jpdc.2006.06.001openalex-snapshot
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
inferredcites →https://doi.org/10.1109/12.795218openalex-snapshot
A chip-multiprocessor architecture with speculative multithreading
inferredcites →https://doi.org/10.1109/hpca.1998.650541openalex-snapshot
The potential for using thread-level data speculation to facilitate automatic parallelization
inferredcites →https://doi.org/10.1109/icpp.2009.60openalex-snapshot
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
inferredcites →https://doi.org/10.1109/ipdps.2008.4536297openalex-snapshot
A helper thread based EDP reduction scheme for adapting application execution in CMPs
inferredcites →https://doi.org/10.1109/isca.2001.937426openalex-snapshot
Execution-based prediction using speculative slices
inferredcites →https://doi.org/10.1109/isca.2001.937427openalex-snapshot
Speculative precomputation: long-range prefetching of delinquent loads
inferredcites →https://doi.org/10.1109/pact.2005.7openalex-snapshot
An event-driven multithreaded dynamic optimization framework
inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot
R-MAT: A Recursive Model for Graph Mining
inferredcites →https://doi.org/10.1145/1504176.1504182openalex-snapshot
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
inferredcites →https://doi.org/10.1145/291069.291020openalex-snapshot
Data speculation support for a chip multiprocessor
inferredcites →https://doi.org/10.1145/300979.300995openalex-snapshot
Simultaneous subordinate microthreading (SSMT)
inferredcites →https://doi.org/10.1145/307338.300995openalex-snapshot
Simultaneous subordinate microthreading (SSMT)
inferredcites →https://doi.org/10.1145/379240.379246openalex-snapshot
Execution-based prediction using speculative slices
inferredcites →https://doi.org/10.1145/379240.379250openalex-snapshot
Tolerating memory latency through software-controlled pre-execution in simultaneous multithreading processors
inferredcites →https://doi.org/10.2307/2033241openalex-snapshot
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-67035-5_8openalex-snapshot
A Distributed Parallel Algorithm for the Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-981-10-5903-2_130openalex-snapshot
Approach to Find Shortest Path Using Ant Colony Algorithm
inferred← citeshttps://doi.org/10.1016/j.ijdrr.2021.102150openalex-snapshot
Intentions of university students and staff members to re-enter chemical storage buildings immediately after a major earthquake: A case study in Japan
inferred← citeshttps://doi.org/10.1109/ias54023.2022.9940073openalex-snapshot
A Deep Reinforcement Learning-based Approach to Post-Disaster Routing of Movable Energy Resources
inferred← citeshttps://doi.org/10.1109/icces.2016.7821986openalex-snapshot
Efficient Single-Linkage hierarchical clustering based on partitioning
inferred← citeshttps://doi.org/10.1109/icdim.2013.6693966openalex-snapshot
Genetic programming based degree constrained spanning tree extraction
inferred← citeshttps://doi.org/10.1109/icicct.2017.7975216openalex-snapshot
Exploring the parallel implementations of the three classical MST algorithms
inferred← citeshttps://doi.org/10.1109/mias.2023.3325046openalex-snapshot
Postdisaster Routing of Movable Energy Resources for Enhanced Distribution System Resilience: A Deep Reinforcement Learning-Based Approach
inferred← citeshttps://doi.org/10.1145/2509136.2509533openalex-snapshot
Turning nondeterminism into parallelism
inferred← citeshttps://doi.org/10.1145/2544173.2509533openalex-snapshot
Turning nondeterminism into parallelism
inferred← citeshttps://doi.org/10.1145/3558481.3591082openalex-snapshot
Provably-Efficient and Internally-Deterministic Parallel Union-Find
inferred← citeshttps://doi.org/10.30537/sjcms.v1i1.8openalex-snapshot
A Fast Implementation of Minimum Spanning Tree Method and Applying it to Kruskal’s and Prim’s Algorithms
inferred← citeshttps://doi.org/10.3390/electronics12204256openalex-snapshot
Optimal Sizing of Movable Energy Resources for Enhanced Resilience in Distribution Systems: A Techno-Economic Analysis
inferred← citeshttps://doi.org/10.5772/intechopen.89368openalex-snapshot
Parallel Processing for Range Assignment Problem in Wireless Sensor 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.