Report Number: CS-TR-79-761
Institution: Stanford University, Department of Computer Science
Title: Gossiping without duplicate transmissions
Author: West, Douglas B.
Date: August 1979
Abstract: n people have distinct bits of information, which they
communicate via telephone calls in which they transmit
everything they know. We require that no one ever hear the
same piece of information twice. In the case 4 divides n, n
$\geq$ 8, we provide a construction that transmits all
information using only 9n/4-6 calls. Previous constructions
used 1/2 n log n calls.