Pages that link to "Item:Q5362982"
From MaRDI portal
The following pages link to Distributed Computation of Large-scale Graph Problems (Q5362982):
Displaying 14 items.
- Sub-logarithmic distributed algorithms for metric facility location (Q748120) (← links)
- Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Sparse matrix multiplication and triangle listing in the congested clique model (Q2290622) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- (Q5090924) (← links)
- (Q5091074) (← links)
- (Q5091075) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
- Distributed PageRank computation with improved round complexities (Q6195176) (← links)
