The following pages link to (Q4608063):
Displaying 20 items.
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Approximate minimum directed spanning trees under congestion (Q2117742) (← links)
- GHS algorithm on a graph with random weights (Q2182653) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- Simple Distributed Spanners in Dense Congest Networks (Q3297775) (← links)
- (Q5075750) (← links)
- (Q5090922) (← links)
- Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds (Q5090932) (← links)
- (Q5091075) (← links)
- (Q5091162) (← links)
- (Q5092346) (← links)
- (Q5121896) (← 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)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
- Distributed PageRank computation with improved round complexities (Q6195176) (← links)
