Pages that link to "Item:Q2796207"

The following pages link to Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy (Q2796207):

Displaying 8 items.

• Certifying equality with limited interaction (Q343864) (← links)
• When distributed computation is communication expensive (Q1689746) (← links)
• Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
• The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model (Q2817860) (← links)
• Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729) (← links)
• The Communication Complexity of Distributed epsilon-Approximations (Q4978194) (← links)
• (Q4999000) (← links)
• (Q5090444) (← links)