On the public citation graph
Work‐efficient parallel union‐find
0 signed · 34 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/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1007/978-3-319-43659-3_41openalex-snapshot
Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity
inferredcites →https://doi.org/10.1007/978-3-642-14390-8_20openalex-snapshot
A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.013openalex-snapshot
On graph problems in a semi-streaming model
inferredcites →https://doi.org/10.1016/j.tcs.2010.08.030openalex-snapshot
Adapting parallel algorithms to the W-Stream model, with applications to graph problems
inferredcites →https://doi.org/10.1109/hipc.2013.6799108openalex-snapshot
A new parallel algorithm for connected components in dynamic graphs
inferredcites →https://doi.org/10.1109/ipdps.2012.79openalex-snapshot
Multi-core Spanning Forest Algorithms using the Disjoint-set Data Structure
inferredcites →https://doi.org/10.1109/sfcs.1986.9openalex-snapshot
An optimal randomized parallel algorithm for finding connected components in a graph
inferredcites →https://doi.org/10.1137/0218041openalex-snapshot
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
inferredcites →https://doi.org/10.1137/0220066openalex-snapshot
An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot
R-MAT: A Recursive Model for Graph Mining
inferredcites →https://doi.org/10.1137/1.9781611973105.81openalex-snapshot
Dynamic graph connectivity in polylogarithmic worst case time
inferredcites →https://doi.org/10.1137/s0097539703439088openalex-snapshot
Top-Down Analysis of Path Compression
inferredcites →https://doi.org/10.1145/103418.103458openalex-snapshot
Wait-free parallel algorithms for the union-find problem
inferredcites →https://doi.org/10.1145/1644015.1644021openalex-snapshot
Trading off space for passes in graph streaming problems
inferredcites →https://doi.org/10.1145/2145816.2145840openalex-snapshot
Internally deterministic parallel algorithms can be fast
inferredcites →https://doi.org/10.1145/2501221.2501234openalex-snapshot
Maintaining connected components for infinite graph streams
inferredcites →https://doi.org/10.1145/2612669.2612692openalex-snapshot
A simple and practical linear-work parallel algorithm for connectivity
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.5555/2627817.2627898openalex-snapshot
Dynamic graph connectivity in polylogarithmic worst case time
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-43659-3_41openalex-snapshot
Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity
inferred← citeshttps://doi.org/10.1007/s11277-020-07312-3openalex-snapshot
Pseudo-Cache-Based IoT Small Files Management Framework in HDFS Cluster
inferred← citeshttps://doi.org/10.1016/j.ress.2026.113047openalex-snapshot
A novel homology-based framework for K-terminal network reliability estimation under mixed failure modes
inferred← citeshttps://doi.org/10.1038/s41467-025-63214-7openalex-snapshot
Localized statistics decoding for quantum low-density parity-check codes
inferred← citeshttps://doi.org/10.1101/2020.08.21.261313openalex-snapshot
Identifying Taxonomic Units in Metagenomic DNA Streams
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00089openalex-snapshot
BTS: Load-Balanced Distributed Union-Find for Finding Connected Components with Balanced Tree Structures
inferred← citeshttps://doi.org/10.1109/tcbb.2022.3172661openalex-snapshot
Identifying Taxonomic Units in Metagenomic DNA Streams on Mobile Devices
inferred← citeshttps://doi.org/10.1109/tpds.2025.3582996openalex-snapshot
$\text {GPUSCAN}^{++}$: Efficient Structural Graph Clustering on GPUs
inferred← citeshttps://doi.org/10.1137/1.9781611976489.10openalex-snapshot
Parallel Batch-Dynamic k -Clique Counting
inferred← citeshttps://doi.org/10.48550/arxiv.2008.03909openalex-snapshot
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms
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.