91 search results - page 5 / 19 » Multiparty Communication Complexity of Disjointness |
TAMC
2007
Springer
14 years 1 months ago
2007
Springer
TOC
2010
13 years 2 months ago
2010
SCN
2010
Springer
13 years 6 months ago
2010
Springer
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...
FAW
2009
Springer
14 years 4 days ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
CTRSA
2006
Springer
13 years 11 months ago
2006
Springer
In this work, we initiate the study of realizing a ranking functionality (m1,