✦ LIBER ✦

Quick gossiping by telegraphs

✍ Scribed by Roger Labahn; Ingo Warnke

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 186 KB
Volume: 126
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90290-9

No coin nor oath required. For personal study only.

✦ Synopsis

We consider gossiping in the complete doubly directed graph, i.e. telegrams arranged in rounds are used to exchange information between n points, each having one initial item.It is proved that at least 1.44'..log, n rounds are needed to inform everybody about those n distinct items of information.

📜 SIMILAR VOLUMES

Gossips and telegraphs

✍ Roger C. Entringer; Peter J. Slater 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 522 KB

Suppose we have a group of n people, each possessing an item of information not known to any of the others and that during each unit of time each person can send all of the information he knows to at most k other people. Further suppose that each of at most k other people can send all of the informa

Underground telegraphs

✍ C. 📂 Article 📅 1878 🏛 Elsevier Science 🌐 English ⚖ 111 KB

Chinese telegraphs

📂 Article 📅 1884 🏛 Elsevier Science 🌐 English ⚖ 64 KB

Communication Complexity of Gossiping by

Communication Complexity of Gossiping by Packets

✍ Luisa Gargano; Adele A. Rescigno; Ugo Vaccaro 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 153 KB

This paper considers the problem of gossiping with packets of limited size in a network with a cost function. We show that the problem of determining the minimum cost necessary to perform gossiping among a given set of participants with packets of limited size is NP-hard. We also give an approximate

Parallel algorithms for gossiping by mai

Parallel algorithms for gossiping by mail

✍ A. Bagchi; S.L. Hakimi; J. Mitchem; E. Schmeichel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 535 KB

Electric time telegraphs

✍ Louis H. Spellier 📂 Article 📅 1880 🏛 Elsevier Science 🌐 English ⚖ 193 KB