Title
One-Round Multi-Party Communication Complexity of Distinguishing Sums
Abstract
We consider an instance of the following problem: Parties P"1,...,P"k each receive an input x"i, and a coordinator (distinct from each of these parties) wishes to compute f(x"1,...,x"k) for some pr...
Year
Venue
DocType
2013
Electronic Colloquium on Computational Complexity (ECCC)
Journal
Volume
Citations 
PageRank 
abs/1301.4269
0
0.34
References 
Authors
2
3
Name
Order
Citations
PageRank
Daniel Apon1314.68
Jonathan Katz27579347.97
Alex J. Malozemoff31588.98