Pages that link to "Item:Q5197674"
From MaRDI portal
The following pages link to Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover (Q5197674):
Displaying 18 items.
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966) (← links)
- A simple augmentation method for matchings with applications to streaming algorithms (Q5005178) (← links)
- (Q5075750) (← links)
- Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds (Q5090932) (← links)
- Congested Clique Algorithms for Graph Spanners (Q5090933) (← links)
- (Q5091075) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
- Time-optimal construction of overlay networks (Q6096036) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
- Improved MPC algorithms for MIS, matching, and coloring on trees and beyond (Q6535033) (← links)
- The hardness of optimization problems on the weighted massively parallel computation model (Q6591624) (← links)
