BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-79-761
       ENTRY:: June 19, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Gossiping without duplicate transmissions
        TYPE:: Technical Report
      AUTHOR:: West, Douglas B.
        DATE:: August 1979
       PAGES:: 6
    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.
       NOTES:: [Adminitrivia V1/Prg/19950619]
         END:: STAN//CS-TR-79-761