Pages that link to "Item:Q5700572"

The following pages link to Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds (Q5700572):

Displaying 35 items.

• Local MST computation with short advice (Q613116) (← links)
• Sub-logarithmic distributed algorithms for metric facility location (Q748120) (← links)
• Lessons from the congested clique applied to MapReduce (Q896148) (← links)
• Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
• A fast distributed approximation algorithm for minimum spanning trees (Q1954259) (← links)
• Randomized proof-labeling schemes (Q2002054) (← links)
• Algebraic methods in the congested clique (Q2010605) (← links)
• The role of randomness in the broadcast congested clique model (Q2051760) (← links)
• Fast approximate shortest paths in the congested clique (Q2064057) (← links)
• Breaking the \(\log n\) barrier on rumor spreading (Q2075628) (← links)
• Near-optimal scheduling in the congested clique (Q2117708) (← links)
• Approximate minimum directed spanning trees under congestion (Q2117742) (← links)
• Graph reconstruction in the congested clique (Q2186818) (← links)
• Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
• Message lower bounds via efficient network synchronization (Q2292919) (← links)
• Analysis of randomized protocols for conflict-free distributed access (Q2461541) (← links)
• A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← 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)
• Sparsifying Congested Cliques and Core-Periphery Networks (Q2835033) (← links)
• Simple Distributed Spanners in Dense Congest Networks (Q3297775) (← links)
• On the Microscopic View of Time and Messages (Q4686647) (← links)
• Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
• (Delta+1) Coloring in the Congested Clique Model (Q5002850) (← links)
• Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds (Q5090932) (← links)
• Congested Clique Algorithms for Graph Spanners (Q5090933) (← links)
• (Q5091075) (← links)
• (Q5092346) (← links)
• Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
• The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
• Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
• Distributed MST for constant diameter graphs (Q5919895) (← links)
• Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
• Distributed computing with the Cloud (Q6126134) (← links)
• Distributed Computing with the Cloud (Q6488431) (← links)