2924 search results - page 87 / 585 » Lower Bounds in Distributed Computing |
COCO
2009
Springer
14 years 3 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
ISPAN
1999
IEEE
14 years 1 months ago
1999
IEEE
Current distributed parallel platforms can provide the resources required to execute a scientific application efficiently. However, when these platforms are shared by multiple use...
ALT
2002
Springer
14 years 5 months ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
ICDCN
2010
Springer
14 years 29 days 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...
SOFSEM
1997
Springer
14 years 1 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...