5 citations · 5 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2014
On the Power of Multiplexing in Number-on-the-Forehead Protocols
Eldar Aharoni, Eyal Kushilevitz
We study the direct-sum problem for -party ``Number On the Forehead'' (NOF) deterministic communication complexity. We prove several positive results, showing that the complexit…
cs.CC2009
Partition Arguments in Multiparty Communication Complexity
Jan Draisma, Eyal Kushilevitz, Enav Weinreb
Consider the "Number in Hand" multiparty communication complexity model, where k players holding inputs x_1,...,x_k in {0,1}^n communicate to compute the value f(x_1,...,x_k) of a…