scientific article; zbMATH DE number 4189783

MaRDI QIDQ5753992zbMATH OpenFDO

Authors Ákos Seress

Publication date 1989

zbMATH Keywords

conferencegossip problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99) Network design and communication in computer systems (68M10) Communication networks in operations research (90B18) Social networks; opinion dynamics (91D30) General systems theory (93A99) Communication theory (94A05)

Recommendations

• Quick gossiping without duplicate transmissions
• The exact gossiping problem
• scientific article; zbMATH DE number 15364
• scientific article; zbMATH DE number 4158677
• Quick gossiping by telegraphs

Cited in

(17)

• Quick gossiping without duplicate transmissions
• The addition game: An abstraction of a communication problem
• Quick gossiping by telegraphs
• The exact gossiping problem
• Kernels of minimum size gossip schemes
• Gossiping with multiple sends and receives
• Reordered gossip schemes
• Gossip Latin square and the meet-all gossipers problem
• Lossy gossip and composition of metrics
• On optimal solutions to the problem of gossiping in minimum time
• On Gossiping with Faulty Telephone Lines
• scientific article; zbMATH DE number 15364 (Why is no real title available?)
• Gossiping in Minimal Time
• Fast Gossiping by Short Messages
• scientific article; zbMATH DE number 2061800 (Why is no real title available?)
• scientific article; zbMATH DE number 2114510 (Why is no real title available?)
• A class of solutions to the gossip problem. III

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753992)