Pages that link to "Item:Q5384015"
From MaRDI portal
The following pages link to An Optimal Lower Bound for Distinct Elements in the Message Passing Model (Q5384015):
Displaying 7 items.
- When distributed computation is communication expensive (Q1689746) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Lower bounds for number-in-hand multiparty communication complexity, made easy (Q2796207) (← links)
- The Range of Topological Effects on Communication (Q3449503) (← links)
- The Communication Complexity of Distributed epsilon-Approximations (Q4978194) (← links)
- Dense limit of the Dawid–Skene model for crowdsourcing and regions of sub-optimality of message passing algorithms (Q5060424) (← links)
- (Q5090444) (← links)