Titlebook: Distributed Computing; 15th International C Jennifer Welch Conference proceedings 2001 Springer-Verlag Berlin Heidelberg 2001 Complexity.Co

Arboreal

Jennifer WelchIncludes supplementary material:

發(fā)牢騷

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281797.jpg

DIKE

PARA

LAST

空中

Implicit

An Effective Characterization of Computability in Anonymous Networks,We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, and know at least a bound on the network size. Three activation models are considered (synchronous, asynchronous, interleaved).

lethal

Optimal Unconditional Information Diffusion,We present an algorithm for propagating updates with information theoretic security that propagates an update in time logarithmic in the number of replicas and linear in the number of corrupt replicas. We prove a matching lower bound for this problem..I cannot tell how the truth may be; I say the tale as’ twas said to me. — Sir Walter Scott

OCTO

gout109