高度表
发表于 2025-3-28 17:36:40
https://doi.org/10.1007/3-540-40026-5Algorithms; Broadcast; CORBA; Internet; Roadcasting; algorithm; distributed computing; algorithm analysis a
不能仁慈
发表于 2025-3-28 18:49:21
http://reply.papertrans.cn/29/2818/281789/281789_42.png
保守
发表于 2025-3-28 23:32:37
http://reply.papertrans.cn/29/2818/281789/281789_43.png
倔强一点
发表于 2025-3-29 05:51:44
https://doi.org/10.1007/978-3-319-07920-2our algorithm, each process p performs O(min(k,log N)) remote memory references to enter and exit its critical section, where k is the maximum “point contention” experienced by p. The space complexity of our algorithm is <9(iV), which is clearly optimal.
泥沼
发表于 2025-3-29 09:07:51
http://reply.papertrans.cn/29/2818/281789/281789_45.png
Traumatic-Grief
发表于 2025-3-29 11:24:44
Conference proceedings 2000 2000 was held on4-6 October, 2000 in Toledo, Spain. This volume includes 23 contributed papers and the extended abstract of an invited lecture from last year’s DISC. It is expected that the regular papers will later be submitted in a more polished form to fully refereed scienti?c journals. The exte
轻弹
发表于 2025-3-29 19:38:30
http://reply.papertrans.cn/29/2818/281789/281789_47.png
ADJ
发表于 2025-3-29 19:55:09
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs, enumeration, we show not only that (somehow surprisingly) the same bound holds for regular graphs, but also that it can be improved to Ω(n log log n/ log n). We also show that Ω (d.√log log d.) colours are necessary, where d. is the degree of G.
无目标
发表于 2025-3-30 01:04:34
http://reply.papertrans.cn/29/2818/281789/281789_49.png
翅膀拍动
发表于 2025-3-30 05:39:12
http://reply.papertrans.cn/29/2818/281789/281789_50.png