Sciweavers

1506 search results - page 302 / 302
» On the Distribution of Natural Probability Functions
Sort
View
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
11 years 7 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang