On the public citation graph
Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
0 signed · 90 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.1002/(sici)1098-2418(199705)10:3<385::aid-rsa6>3.0.co;2-sopenalex-snapshot
Nearly optimal distributed edge coloring in O(log log n) rounds
inferredcites →https://doi.org/10.1006/jagm.1998.0929openalex-snapshot
Fast Distributed Construction of Smallk-Dominating Sets and Applications
inferredcites →https://doi.org/10.1007/3-540-44676-1_29openalex-snapshot
Distributed O(Δ log n)-Edge-Coloring Algorithm
inferredcites →https://doi.org/10.1007/3-540-45022-x_2openalex-snapshot
Clique Is Hard to Approximate within n 1-o(1)
inferredcites →https://doi.org/10.1007/3-540-60313-1_162openalex-snapshot
Near-optimal distributed edge coloring
inferredcites →https://doi.org/10.1016/j.dam.2003.10.004openalex-snapshot
Distributed algorithm for approximating the maximum matching
inferredcites →https://doi.org/10.1016/j.jcss.2005.04.002openalex-snapshot
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
inferredcites →https://doi.org/10.1016/s0304-3975(02)00535-2openalex-snapshot
Towards optimal lower bounds for clique and chromatic number
inferredcites →https://doi.org/10.1017/s00446-002-0078-0openalex-snapshot
An efficient distributed algorithm for constructing small dominating sets
inferredcites →https://doi.org/10.1109/sfcs.1985.7openalex-snapshot
An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees
inferredcites →https://doi.org/10.1109/sfcs.1989.63504openalex-snapshot
Network decomposition and locality in distributed computation
inferredcites →https://doi.org/10.1109/sfcs.1996.548493openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1109/sffcs.1999.814597openalex-snapshot
A near-tight lower bound on the time complexity of distributed MST construction
inferredcites →https://doi.org/10.1137/0218050openalex-snapshot
An Optimal Synchronizer for the Hypercube
inferredcites →https://doi.org/10.1137/0221015openalex-snapshot
Locality in Distributed Graph Algorithms
inferredcites →https://doi.org/10.1137/1.9780898719772openalex-snapshot
Distributed Computing: A Locality-Sensitive Approach
inferredcites →https://doi.org/10.1137/s0097539793250767openalex-snapshot
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
inferredcites →https://doi.org/10.1137/s0097539794261118openalex-snapshot
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot
Approximation Algorithms for NP-Hard Problems
inferredcites →https://doi.org/10.1145/28395.28421openalex-snapshot
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems
inferredcites →https://doi.org/10.1145/301250.301325openalex-snapshot
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
inferredcites →https://doi.org/10.1145/323596.323612openalex-snapshot
Improvements in the time complexity of two message-optimal election algorithms
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/383962.383984openalex-snapshot
Distributed MST for constant diameter graphs
inferredcites →https://doi.org/10.1145/872035.872040openalex-snapshot
Constant-time distributed dominating set approximation
inferredcites →https://doi.org/10.5555/314161.314266openalex-snapshot
Nearly optimal distributed edge colouring in O(log log n) rounds
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11780823_9openalex-snapshot
Fast Deterministic Distributed Algorithms for Sparse Spanners
inferred← citeshttps://doi.org/10.1007/11864219_25openalex-snapshot
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_3openalex-snapshot
Awake Complexity of Distributed Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_12openalex-snapshot
Randomized Lower Bound for Distributed Spanning-Tree Verification
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_41openalex-snapshot
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_14openalex-snapshot
Near-Optimal Distributed Tree Embedding
inferred← citeshttps://doi.org/10.1007/978-3-662-46078-8_31openalex-snapshot
Filling Logarithmic Gaps in Distributed Complexity for Global Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_3openalex-snapshot
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks
inferred← citeshttps://doi.org/10.1007/978-981-13-2285-3_79openalex-snapshot
Performance Impact on Different Parameters by the Continuous Evolution of Distributed Algorithms in Wireless Sensor Networks: A Study
inferred← citeshttps://doi.org/10.1007/s00224-010-9280-9openalex-snapshot
Local MST Computation with Short Advice
inferred← citeshttps://doi.org/10.1007/s00446-005-0127-6openalex-snapshot
Distributed MST for constant diameter graphs
inferred← citeshttps://doi.org/10.1007/s00446-007-0047-8openalex-snapshot
A fast distributed approximation algorithm for minimum spanning trees
inferred← citeshttps://doi.org/10.1007/s00446-020-00376-1openalex-snapshot
Derandomizing local distributed algorithms under bandwidth restrictions
inferred← citeshttps://doi.org/10.1007/s00446-020-00383-2openalex-snapshot
Low-Congestion shortcuts without embedding
inferred← citeshttps://doi.org/10.1007/s00446-020-00386-zopenalex-snapshot
Redundancy in distributed proofs
inferred← citeshttps://doi.org/10.1007/s00446-021-00412-8openalex-snapshot
Single-source shortest paths in the CONGEST model with improved bounds
inferred← citeshttps://doi.org/10.1007/s00446-023-00454-0openalex-snapshot
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts
inferred← citeshttps://doi.org/10.1007/s11227-010-0484-1openalex-snapshot
A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs
inferred← citeshttps://doi.org/10.1016/j.asoc.2011.02.017openalex-snapshot
Learning automata-based algorithms for solving stochastic minimum spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.dsp.2017.02.007openalex-snapshot
Team-optimal distributed MMSE estimation in general and tree networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.07.002openalex-snapshot
A faster distributed protocol for constructing a minimum spanning tree
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.028openalex-snapshot
A simple randomized scheme for constructing low-weight k -connected spanning subgraphs with applications to distributed algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.019openalex-snapshot
Fast deterministic distributed algorithms for sparse spanners
inferred← citeshttps://doi.org/10.1109/tpds.2008.57openalex-snapshot
Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/wmnc.2015.41openalex-snapshot
A Deterministic and a Randomized Algorithm for Approximating Minimum Spanning Tree under the SINR Model
inferred← citeshttps://doi.org/10.1137/06065310xopenalex-snapshot
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch16openalex-snapshot
Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
inferred← citeshttps://doi.org/10.1145/1011767.1011811openalex-snapshot
What cannot be computed locally!
inferred← citeshttps://doi.org/10.1145/1248377.1248402openalex-snapshot
Local MST computation with short advice
inferred← citeshttps://doi.org/10.1145/1400751.1400787openalex-snapshot
Efficient distributed approximation algorithms via probabilistic tree embeddings
inferred← citeshttps://doi.org/10.1145/1835698.1835745openalex-snapshot
Efficient distributed random walks with applications
inferred← citeshttps://doi.org/10.1145/2611462.2611493openalex-snapshot
On the power of the congested clique model
inferred← citeshttps://doi.org/10.1145/2933057.2933109openalex-snapshot
Distributed Algorithms for Planar Networks I
inferred← citeshttps://doi.org/10.1145/2933057.2933112openalex-snapshot
Low-Congestion Shortcuts without Embedding
inferred← citeshttps://doi.org/10.1145/2935764.2935795openalex-snapshot
Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures
inferred← citeshttps://doi.org/10.1145/3055399.3055452openalex-snapshot
Distributed exact shortest paths in sublinear time
inferred← citeshttps://doi.org/10.1145/3087801.3087823openalex-snapshot
A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities
inferred← citeshttps://doi.org/10.1145/3087801.3087827openalex-snapshot
Distributed MST and Routing in Almost Mixing Time
inferred← citeshttps://doi.org/10.1145/3188745.3188948openalex-snapshot
Improved distributed algorithms for exact shortest paths
inferred← citeshttps://doi.org/10.1145/3274651openalex-snapshot
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
inferred← citeshttps://doi.org/10.1145/3293611.3331604openalex-snapshot
Distributed Minimum Degree Spanning Trees
inferred← citeshttps://doi.org/10.1145/3323165.3323195openalex-snapshot
Distributed Computation in Node-Capacitated Networks
inferred← citeshttps://doi.org/10.1145/3380546openalex-snapshot
A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities
inferred← citeshttps://doi.org/10.1145/3382734.3405701openalex-snapshot
Distributed Construction of Light Networks
inferred← citeshttps://doi.org/10.1145/3382734.3405729openalex-snapshot
Single-Source Shortest Paths in the CONGEST Model with Improved Bound
inferred← citeshttps://doi.org/10.1145/3382734.3405750openalex-snapshot
Distributed Approximation on Power Graphs
inferred← citeshttps://doi.org/10.1145/3387161openalex-snapshot
Distributed Exact Shortest Paths in Sublinear Time
inferred← citeshttps://doi.org/10.1145/3465084.3467927openalex-snapshot
Low-Congestion Shortcuts in Constant Diameter Graphs
inferred← citeshttps://doi.org/10.1145/3465084.3467935openalex-snapshot
Low-Congestion Shortcuts for Graphs Excluding Dense Minors
inferred← citeshttps://doi.org/10.1145/3519270.3538459openalex-snapshot
Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds
inferred← citeshttps://doi.org/10.1145/3519270.3538464openalex-snapshot
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver
inferred← citeshttps://doi.org/10.1145/3519935.3520026openalex-snapshot
Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality
inferred← citeshttps://doi.org/10.1201/9781351236423-12openalex-snapshot
Distributed Approximation Algorithms via LP-Duality and Randomization
inferred← citeshttps://doi.org/10.1201/9781584888215-c27openalex-snapshot
Theory of Communication Networks
inferred← citeshttps://doi.org/10.3929/ethz-a-005273546openalex-snapshot
Locality, Scheduling, and Selfishness: Algorithmic Foundations of Highly Decentralized Networks
inferred← citeshttps://doi.org/10.48550/arxiv.0911.3195openalex-snapshot
Efficient Distributed Random Walks with Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1610.00681openalex-snapshot
Team-Optimal Distributed MMSE Estimation in General and Tree Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1806.03365openalex-snapshot
Distributed Algorithms for Minimum Degree Spanning Trees
inferred← citeshttps://doi.org/10.5555/982792.982844openalex-snapshot
A faster distributed protocol for constructing a minimum spanning tree
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.