29908 search results - page 14 / 5982 » On the complexity of communication complexity |
169
click to vote
SODA
2012
ACM
13 years 6 months 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 ...
166
click to vote
CRYPTO
2008
Springer
15 years 5 months ago
2008
Springer
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
124
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
133
click to vote
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
15 years 11 months ago
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
134
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...