Sciweavers

4616 search results - page 25 / 924
» The Communication Complexity of Correlation
Sort
View
PODC
2012
ACM
13 years 2 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
15 years 6 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—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...
Joshua Brody
CC
2010
Springer
282views System Software» more  CC 2010»
14 years 10 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
CRYPTO
2006
Springer
97views Cryptology» more  CRYPTO 2006»
15 years 3 months ago
Robust Multiparty Computation with Linear Communication Complexity
We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively secur...
Martin Hirt, Jesper Buus Nielsen
ATAL
2004
Springer
15 years 5 months ago
On the Communication Complexity of Multilateral Trading
We study the complexity of a multilateral negotiation framework where autonomous agents agree on a sequence of deals to exchange sets of discrete resources in order to both furthe...
Ulrich Endriss, Nicolas Maudet