Multiparty communication complexity

In the two–party communication game, introduced by , two players, P1 and P2 attempt to compute a Boolean function Player P1 knows the value of x2, P2… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1989-2016
051019892016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
We study the set disjointness problem in the number-on-the-forehead model of multiparty communication. (i) We prove that k-party… (More)
Is this relevant?
2009
2009
Consider the “Number in Hand” multiparty communication complexity model, where k players holding inputs x1, . . . , xk ∈ {0, 1… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We obtain a lower bound of n on the k-party randomized communication complexity of the Disjointness function in the ‘Number on… (More)
  • figure 1
  • figure 2
Is this relevant?
2008
2008
We prove n lower bounds on the multiparty communication complexity of AC functions in the number-on-forehead (NOF) model for up… (More)
Is this relevant?
2008
2008
We prove an nΩ(1)/4k lower bound on the randomized k-party communication<lb>complexity of depth 4 AC0 functions in the number-on… (More)
Is this relevant?
2007
2007
We study the relationship between the complexity of languages, in Yao's 2-party communication game and its extensions, and the… (More)
Is this relevant?
2006
2006
We study languages with bounded communication complexity in the multiparty “input on the forehead model” with worst-case… (More)
Is this relevant?
2002
2002
(MATH) We extend recent techniques for time-space tradeoff lower bounds using multiparty communication complexity ideas. Using… (More)
Is this relevant?
1999
1999
We consider the multiparty communication model deened in DF89] using the formalism from Hr97]. First, we correct an inaccuracy in… (More)
Is this relevant?
1989
1989
A given Boolean function has its input distributed among ma,ny parties. The aim is to determine which parties t o talk t o and… (More)
Is this relevant?