𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast Distributed Algorithms for Computing Separable Functions

✍ Scribed by Mosk-Aoyama, D.; Shah, D.

Book ID
114641346
Publisher
IEEE
Year
2008
Tongue
English
Weight
287 KB
Volume
54
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast Distributed Algorithms for Brooks–V
Fast Distributed Algorithms for Brooks–Vizing Colorings
✍ David A Grable; Alessandro Panconesi πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 208 KB

Let G be a ⌬-regular graph with n vertices and girth at least 4 such that ⌬ 4 log n. We give very simple, randomized, distributed algorithms for vertex Ž . coloring G with ⌬rk colors in O k q log n communication rounds, where k s Ž . O log ⌬ . The algorithm may fail or exceed the above running time,

Distributed algorithms for reaching cons
Distributed algorithms for reaching consensus on general functions
✍ Jorge CortΓ©s πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 428 KB

This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of the network agents. Under mild smoothness assumptions, we obtain necessary and sufficient conditions characterizing any alg