524 search results - page 4 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulti...
ICDCN
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
STACS
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
FOCS
2003
IEEE
14 years 28 days ago
2003
IEEE
CORR
2008
Springer
13 years 7 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...