Pages that link to "Item:Q5230311"
From MaRDI portal
The following pages link to Round compression for parallel matching algorithms (Q5230311):
Displaying 6 items.
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966) (← links)
- (Q5075750) (← links)
- (Q5091162) (← links)
- (Q5874548) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)