6 search results - page 1 / 2 » The Maximum Communication Complexity of Multi-Party Pointer ... |
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 4 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...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
COCO
2007
Springer
13 years 10 months ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...