Sciweavers

3 search results - page 1 / 1
» Separating Deterministic from Nondeterministic NOF Multipart...
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
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...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
TOC
2010
106views Management» more  TOC 2010»
13 years 2 months ago
Separating Deterministic from Randomized Multiparty Communication Complexity
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
14 years 2 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—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...
Joshua Brody