91 search results - page 4 / 19 » Multiparty Communication Complexity of Disjointness |
164
Voted
PODC
2012
ACM
13 years 5 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
123
click to vote
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
130
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
129
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—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...
77
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer