On the public citation graph

Practical parallel Union-Find algorithms for transitive closure and clustering

0 signed · 38 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01379321openalex-snapshot
Parallel evaluation of the transitive closure of a database relation
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0022-0000(89)90013-5openalex-snapshot
Fast and efficient solution of path algebra problems
inferredcites →https://doi.org/10.1016/0166-218x(84)90019-2openalex-snapshot
An optimal parallel connectivity algorithm
inferredcites →https://doi.org/10.1016/s0019-9958(83)80060-6openalex-snapshot
Parallel computation for well-endowed rings and space-bounded probabilistic machines
inferredcites →https://doi.org/10.1117/12.942023openalex-snapshot
Parallel Algorithms For Classification And Clustering
inferredcites →https://doi.org/10.1137/0909041openalex-snapshot
Development of Parallel Methods for a $1024$-Processor Hypercube
inferredcites →https://doi.org/10.1145/358628.358650openalex-snapshot
Efficient parallel algorithms for some graph problems
inferredcites →https://doi.org/10.1145/62.2160openalex-snapshot
Worst-case Analysis of Set Union Algorithms
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.
inferredcites →https://doi.org/10.2307/2344977openalex-snapshot
Pattern Classification and Scene Analysis.
inferredcites →https://doi.org/10.5555/62597.62605openalex-snapshot
Multiprocessor transitive closure 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.1849openalex-snapshot
Accelerating physics in large, continuous virtual environments
inferred← citeshttps://doi.org/10.1007/978-3-642-14390-8_20openalex-snapshot
A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers
inferred← citeshttps://doi.org/10.1007/978-3-642-37658-0_13openalex-snapshot
A Fast Parallel Graph Partitioner for Shared-Memory Inspector/Executor Strategies
inferred← citeshttps://doi.org/10.1007/s00778-026-00977-5openalex-snapshot
Efficiently querying connected components in large temporal graphs via scalable and maintainable indices
inferred← citeshttps://doi.org/10.1007/s41019-025-00287-wopenalex-snapshot
Hierarchical Isomerism Distributed Equivalent Union Find for Billion-Scale Disjoint Sets: A Case Study
inferred← citeshttps://doi.org/10.1016/0020-0255(96)00053-9openalex-snapshot
Parallel transitive closure computation in relational databases
inferred← citeshttps://doi.org/10.1016/j.parco.2015.02.005openalex-snapshot
Evaluation of connected-component labeling algorithms for distributed-memory systems
inferred← citeshttps://doi.org/10.1109/csb.2002.1039345openalex-snapshot
High similarity sequence comparison in clustering large sequence databases
inferred← citeshttps://doi.org/10.1109/dasc/picom/cbdcom/cyberscitech.2019.00148openalex-snapshot
Generative Model for Probabilistic Inference
inferred← citeshttps://doi.org/10.1109/hipc.2018.00044openalex-snapshot
Parallel Read Partitioning for Concurrent Assembly of Metagenomic Data
inferred← citeshttps://doi.org/10.1109/icci.1993.315322openalex-snapshot
Parallel naive and semi-naive transitive closure evaluation
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/ipdps.2012.79openalex-snapshot
Multi-core Spanning Forest Algorithms using the Disjoint-set Data Structure
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00037openalex-snapshot
Communication-efficient Massively Distributed Connected Components
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.159openalex-snapshot
Parallel and Memory-Efficient Preprocessing for Metagenome Assembly
inferred← citeshttps://doi.org/10.1109/ldav64567.2024.00007openalex-snapshot
Distributed Path Compression for Piecewise Linear Morse-Smale Segmentations and Connected Components
inferred← citeshttps://doi.org/10.1109/tvcg.2021.3074584openalex-snapshot
Asynchronous and Load-Balanced Union-Find for Distributed and Parallel Scientific Data Visualization and Analysis
inferred← citeshttps://doi.org/10.1109/tvcg.2026.3678875openalex-snapshot
Massively Parallel Augmented Merge Tree Computation Based on the Bipartite Graph
inferred← citeshttps://doi.org/10.1111/cgf.70497openalex-snapshot
Scalable Computation of Topological Abstractions for Scalar Data
inferred← citeshttps://doi.org/10.1137/15m1021325openalex-snapshot
A Parallel Edge Orientation Algorithm for Quadrilateral Meshes
inferred← citeshttps://doi.org/10.1145/3309697.3331503openalex-snapshot
Efficient Distributed Workload (Re-)Embedding
inferred← citeshttps://doi.org/10.1145/3322205.3311084openalex-snapshot
Efficient Distributed Workload (Re-)Embedding
inferred← citeshttps://doi.org/10.1145/3376930.3376959openalex-snapshot
Efficient DistributedWorkload (Re-)Embedding
inferred← citeshttps://doi.org/10.13037/ria.vol13n1.171openalex-snapshot
RECONFIGURAÇÃO DE CONTROLE EM UM DRONE QUADRIMOTOR AUXILIADA POR UM CLASSIFICADOR DE FALHAS
inferred← citeshttps://doi.org/10.3390/app15168937openalex-snapshot
Resource-Efficient Decoding of Topological Color Codes via Neural-Guided Union-Find Optimization
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2019.15openalex-snapshot
In Search of the Fastest Concurrent Union-Find Algorithm
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.