2 search results - page 1 / 1 » Dependent Random Graphs and Multi-Party Pointer Jumping |
COCO
2009
Springer
13 years 11 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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
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...