Gossiping Without Duplicate Transmissions.

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 > or = 8, we provide a construction that transmits all information using only 9n/4-6 calls. Previous construction used 1/2n log n calls. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1979
Accession Number
ADA084021

Entities

People

  • Douglas B. West

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Classification
  • Computer Science
  • Computers
  • Construction
  • Contracts
  • Governments
  • Military Research
  • Security
  • Universities

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Educational Psychology
  • Graph Algorithms and Convex Optimization.