Sciweavers

4616 search results - page 28 / 924
» The Communication Complexity of Correlation
Sort
View
SPAA
2010
ACM
13 years 7 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 8 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
ICDCN
2010
Springer
13 years 11 months ago
On Communication Complexity of Secure Message Transmission in Directed Networks
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
AAMAS
2002
Springer
13 years 7 months ago
Environmental Risk, Cooperation, and Communication Complexity
The evolution of collaboration and communication in communities of individuals is a puzzling problem for a wide range of scientific disciplines, spanning from evolutionary theory ...
Péter András, Gilbert Roberts, John ...
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 6 months ago
Strong direct product theorems for quantum communication and query complexity
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
Alexander A. Sherstov