4616 search results - page 30 / 924 » The Communication Complexity of Correlation |
SODA
2012
ACM
11 years 10 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 ...
SODA
2010
ACM
14 years 5 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...
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
14 years 2 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...
ICALP
2007
Springer
14 years 1 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 ...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...