On the public citation graph
Fast Distributed Algorithms for Connectivity and MST in Large Graphs
0 signed · 64 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.1006/jagm.1996.0832openalex-snapshot
Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components
inferredcites →https://doi.org/10.1007/978-3-319-09620-9_2openalex-snapshot
Communication Complexity Lower Bounds in Distributed Message-Passing
inferredcites →https://doi.org/10.1007/978-3-319-26784-5_14openalex-snapshot
Distributed Algorithms for Finding Local Clusters Using Heat Kernel Pagerank
inferredcites →https://doi.org/10.1007/978-3-319-48314-6_6openalex-snapshot
Message Lower Bounds via Efficient Network Synchronization
inferredcites →https://doi.org/10.1007/978-3-642-41527-2_1openalex-snapshot
Distributed Minimum Cut Approximation
inferredcites →https://doi.org/10.1007/s00446-014-0218-3openalex-snapshot
When distributed computation is communication expensive
inferredcites →https://doi.org/10.1007/s00446-014-0225-4openalex-snapshot
Tight bounds for parallel randomized load balancing
inferredcites →https://doi.org/10.1007/s10619-013-7131-9openalex-snapshot
A unifying framework for ℓ 0-sampling algorithms
inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-snapshot
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/j.tcs.2014.02.009openalex-snapshot
Sublinear bounds for randomized leader election
inferredcites →https://doi.org/10.1016/j.tcs.2021.11.026openalex-snapshot
Near-Optimal Clustering in the k-machine model
inferredcites →https://doi.org/10.1109/ccgrid.2015.122openalex-snapshot
HPC-ABDS High Performance Computing Enhanced Apache Big Data Stack
inferredcites →https://doi.org/10.1137/0211027openalex-snapshot
A Scheme for Fast Parallel Communication
inferredcites →https://doi.org/10.1137/1.9780898719772openalex-snapshot
Distributed Computing: A Locality-Sensitive Approach
inferredcites →https://doi.org/10.1137/100793104openalex-snapshot
Almost-Optimal Gossip-Based Aggregate Computation
inferredcites →https://doi.org/10.1137/11085178xopenalex-snapshot
Distributed Verification and Hardness of Distributed Approximation
inferredcites →https://doi.org/10.1137/s0097539704441848openalex-snapshot
Minimum-Weight Spanning Tree Construction in O (log log n ) Communication Rounds
inferredcites →https://doi.org/10.1145/195058.195422openalex-snapshot
Random sampling in cut, flow, and network design problems
inferredcites →https://doi.org/10.1145/1989284.1989289openalex-snapshot
Tight bounds for Lp samplers, finding duplicates in streams, and related problems
inferredcites →https://doi.org/10.1145/1993806.1993853openalex-snapshot
A tight unconditional lower bound on distributed randomwalk computation
inferredcites →https://doi.org/10.1145/201019.201022openalex-snapshot
A randomized linear-time algorithm to find minimum spanning trees
inferredcites →https://doi.org/10.1145/2484239.2501983openalex-snapshot
Optimal deterministic routing and sorting on the congested clique
inferredcites →https://doi.org/10.1145/2591796.2591850openalex-snapshot
Distributed approximation algorithms for weighted shortest paths
inferredcites →https://doi.org/10.1145/2611462.2611488openalex-snapshot
Can quantum communication speed up distributed computation?
inferredcites →https://doi.org/10.1145/2611462.2611493openalex-snapshot
On the power of the congested clique model
inferredcites →https://doi.org/10.1145/2767386.2767405openalex-snapshot
Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication
inferredcites →https://doi.org/10.1145/2767386.2767414openalex-snapshot
Algebraic Methods in the Congested Clique
inferredcites →https://doi.org/10.1145/2767386.2767434openalex-snapshot
Toward Optimal Bounds in the Congested Clique
inferredcites →https://doi.org/10.1145/2933057.2933103openalex-snapshot
MST in Log-Star Rounds of Congested Clique
inferredcites →https://doi.org/10.1145/2935764.2935785openalex-snapshot
Fast Distributed Algorithms for Connectivity and MST in Large Graphs
inferredcites →https://doi.org/10.1145/3055399.3055449openalex-snapshot
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees
inferredcites →https://doi.org/10.1145/3210377.3210409openalex-snapshot
On the Distributed Complexity of Large-Scale Graph Computations
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
inferredcites →https://doi.org/10.14778/2732232.2732238openalex-snapshot
From "think like a vertex" to "think like a graph"
inferredcites →https://doi.org/10.48550/arxiv.1610.03897openalex-snapshot
Super-fast MST Algorithms in the Congested Clique using $o(m)$ Messages
inferredcites →https://doi.org/10.5555/2095116.2095156openalex-snapshot
Analyzing graph structure via linear measurements
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00446-021-00418-2openalex-snapshot
Equivalence classes and conditional hardness in massively parallel computations
inferred← citeshttps://doi.org/10.1007/s00778-025-00951-7openalex-snapshot
On Querying Historical Connectivity in Large-scale Temporal Graphs
inferred← citeshttps://doi.org/10.1007/s00778-026-00989-1openalex-snapshot
On querying minimum spanning tree in temporal graphs
inferred← citeshttps://doi.org/10.1007/s10619-023-07437-xopenalex-snapshot
Balanced parallel triangle enumeration with an adaptive algorithm
inferred← citeshttps://doi.org/10.1016/j.chemolab.2023.104896openalex-snapshot
A key review on graph data science: The power of graphs in scientific studies
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.04.009openalex-snapshot
Parallel algorithms for finding connected components using linear algebra
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.017openalex-snapshot
Message lower bounds via efficient network synchronization
inferred← citeshttps://doi.org/10.1109/aiccsa66935.2025.11315444openalex-snapshot
Weather-Aware Transformer for Real-Time Route Optimization in Drone-as-a-Service Operations
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00012openalex-snapshot
LACC: A Linear-Algebraic Algorithm for Finding Connected Components in Distributed Memory
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00031openalex-snapshot
Efficient Distributed Algorithms in the k-machine model via PRAM Simulations
inferred← citeshttps://doi.org/10.1145/3210377.3210409openalex-snapshot
On the Distributed Complexity of Large-Scale Graph Computations
inferred← citeshttps://doi.org/10.1145/3350755.3400240openalex-snapshot
How Fast Can You Update Your MST?
inferred← citeshttps://doi.org/10.1145/3350755.3400268openalex-snapshot
Efficient Distributed Algorithms for the K-Nearest Neighbors Problem
inferred← citeshttps://doi.org/10.1145/3460900openalex-snapshot
On the distributed complexity of large-scale graph computations
inferred← citeshttps://doi.org/10.48550/arxiv.2002.06762openalex-snapshot
How fast can you update your MST? (Dynamic algorithms for cluster computing)
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.