Arboreal 发表于 2025-3-25 07:00:18

Jennifer WelchIncludes supplementary material:

发牢骚 发表于 2025-3-25 09:11:12

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

DIKE 发表于 2025-3-25 13:27:21

http://reply.papertrans.cn/29/2818/281797/281797_23.png

PARA 发表于 2025-3-25 18:50:33

http://reply.papertrans.cn/29/2818/281797/281797_24.png

LAST 发表于 2025-3-25 22:07:01

http://reply.papertrans.cn/29/2818/281797/281797_25.png

空中 发表于 2025-3-26 01:36:11

http://reply.papertrans.cn/29/2818/281797/281797_26.png

Implicit 发表于 2025-3-26 06:11:11

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 发表于 2025-3-26 12:25:02

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 发表于 2025-3-26 16:35:50

http://reply.papertrans.cn/29/2818/281797/281797_29.png

gout109 发表于 2025-3-26 19:44:04

http://reply.papertrans.cn/29/2818/281797/281797_30.png
页: 1 2 [3] 4 5 6
查看完整版本: Titlebook: Distributed Computing; 15th International C Jennifer Welch Conference proceedings 2001 Springer-Verlag Berlin Heidelberg 2001 Complexity.Co