Pages that link to "Item:Q1689746"
From MaRDI portal
The following pages link to When distributed computation is communication expensive (Q1689746):
Displayed 9 items.
- Connectivity and connected components in the number-in-hand computation model (Q2086717) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy (Q2796207) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- (Q2920963) (redirect page) (← links)
- The Range of Topological Effects on Communication (Q3449503) (← links)
- Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729) (← links)
- (Q5053256) (← links)