112 search results - page 3 / 23 » Rounds in Communication Complexity Revisited |
DAGSTUHL
2004
13 years 9 months ago
2004
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
CTRSA
2006
Springer
13 years 11 months ago
2006
Springer
In this work, we initiate the study of realizing a ranking functionality (m1,
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing...
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...
WDAG
1990
Springer
13 years 11 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...