Pages that link to "Item:Q2303285"
From MaRDI portal
The following pages link to Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory (Q2303285):
Displaying 5 items.
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966) (← links)
- (Q5075750) (← links)
- (Q5091162) (← links)
- Time-optimal construction of overlay networks (Q6096036) (← links)
- Improved MPC algorithms for MIS, matching, and coloring on trees and beyond (Q6535033) (← links)