Sciweavers

3 search results - page 1 / 1
» One-Way Multi-Party Communication Lower Bound for Pointer Ju...
Sort
View
CORR
2008
Springer
101views Education» more  CORR 2008»
13 years 5 months ago
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
Joshua Brody, Amit Chakrabarti
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
13 years 11 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