Pages that link to "Item:Q2955016"
From MaRDI portal
The following pages link to Communication complexity of approximate matching in distributed graphs (Q2955016):
Displaying 8 items.
- When distributed computation is communication expensive (Q1689746) (← links)
- Economic efficiency requires interaction (Q2278948) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy (Q2796207) (← links)
- The Range of Topological Effects on Communication (Q3449503) (← links)
- (Q5090444) (← links)
- (Q5091167) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
