Pages that link to "Item:Q2796246"
From MaRDI portal
The following pages link to Toward Optimal Bounds in the Congested Clique (Q2796246):
Displaying 17 items.
- Lessons from the congested clique applied to MapReduce (Q896148) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Approximate minimum directed spanning trees under congestion (Q2117742) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← 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)
- The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model (Q2817860) (← 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)
- (Q5090922) (← links)
- (Q5090924) (← links)
- (Q5121896) (← links)
- Distributed PageRank computation with improved round complexities (Q6195176) (← links)
