50 search results - page 2 / 10 » Languages with Bounded Multiparty Communication Complexity |
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
119
click to vote
SODA
2012
ACM
13 years 2 days ago
2012
ACM
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 ...
COCO
2003
Springer
15 years 2 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
TAMC
2007
Springer
15 years 3 months ago
2007
Springer