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
New gossips and telephones
✍ Scribed by Walter Knödel
- Publisher
- Elsevier Science
- Year
- 1975
- Tongue
- English
- Weight
- 107 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
Tk co:xtruction is trivial for ~2 = cI .
7k If one orders the partici one Can bve 2 j + 1 call 2 j + 2 for each j.
fter the first round the odd rticipat-ts separatedly can perform the -' procedure, and the even Gse, in the remai For od;l II, CUR CH-I choose ?l"~~rti participants 3nd have 311 t&e others cA1 into them on the first and last rounds, otherwise proceeding as in the 2" C3SC. Tk roccdure achieves the lower bound. iera even 12 let 2 j + 1 call
📜 SIMILAR VOLUMES
Trouvg has invented a cylindrical microphone, which resembles a small dark-lantern, with a carbon crayon substituted for the candle. When placed in the middle of a room, it reveals all secrets. It transmits the voice admirably to a receiving telephone, even when the speaker stands 25 metres (82 ft.)