Pages that link to "Item:Q4973061"

The following pages link to A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees (Q4973061):

Displaying 35 items.

• A distributed approximation algorithm for the minimum degree minimum weight spanning trees (Q436669) (← links)
• A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
• Broadcasting spanning forests on a multiple-access channel (Q1763001) (← links)
• A fast distributed approximation algorithm for minimum spanning trees (Q1954259) (← links)
• Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
• Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
• Latency, capacity, and distributed minimum spanning trees (Q2119398) (← links)
• GHS algorithm on a graph with random weights (Q2182653) (← links)
• Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
• Low-congestion shortcut and graph parameters (Q2241301) (← links)
• Message lower bounds via efficient network synchronization (Q2292919) (← links)
• A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
• A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction (Q2706118) (← links)
• Construction and impromptu repair of an MST in a distributed network with \(o(m)\) communication (Q2796243) (← links)
• Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
• Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
• Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (Q3580979) (← links)
• (Q4446611) (← links)
• A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees (Q4973061) (← links)
• (Q4978020) (redirect page) (← links)
• Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
• A Class of Optimal Structures for Node Computations in Message Passing Algorithms (Q5030271) (← links)
• Detecting cliques in CONGEST networks (Q5090906) (← links)
• (Q5090922) (← links)
• (Q5090924) (← links)
• (Q5090930) (← links)
• A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities (Q5133968) (← links)
• A linear-time optimal-message distributed algorithm for minimum spanning trees (Q5138511) (← links)
• Round- and Message-Optimal Distributed Graph Algorithms (Q5197673) (← links)
• From sequential layers to distributed processes (Q5348853) (← links)
• Distributed MST and Routing in Almost Mixing Time (Q5368953) (← links)
• Distributed MST for constant diameter graphs (Q5919895) (← links)
• A distributed algorithm for directed minimum-weight spanning tree (Q6487532) (← links)
• Communication efficient self-stabilizing leader election (Q6535008) (← links)
• Singularly optimal randomized leader election (Q6535020) (← links)