Gossip Latin square and the meet-all gossipers problem

DOI10.1016/J.IPL.2015.03.001MaRDI QIDQ2348701zbMATH OpenOpenAlexFDO

Authors Nethanel Gelernter, Amir Herzberg

Publication date 15 June 2015

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2015.03.001

zbMATH Keywords

combinatorial problemsgossipLatin square

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial optimization (90C27)

Recommendations

• Gossiping with multiple sends and receives
• Fast gossiping by short messages
• Optimal odd gossiping
• Broadcast and gossip in line-communication mode
• scientific article; zbMATH DE number 4189783

Cites work

• A survey of gossiping and broadcasting in communication networks
• Further gossip problems
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• scientific article; zbMATH DE number 1455120 (Why is no real title available?)
• Tight Bounds on Mimimum Broadcast Networks

This page was built for publication: Gossip Latin square and the meet-all gossipers problem

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