scientific article; zbMATH DE number 2061800

MaRDI QIDQ4457548zbMATH OpenFDO

Authors Giulio Salerni

Publication date 25 March 2004

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Communication theory (94A05)

Recommendations

• scientific article; zbMATH DE number 2114510
• On optimal solutions to the problem of gossiping in minimum time
• scientific article; zbMATH DE number 4189783
• The exact gossiping problem
• Optimal odd gossiping

Cited in

(9)

• Parallel algorithms for gossiping by mail
• scientific article; zbMATH DE number 2114510 (Why is no real title available?)
• Almost-optimal gossip-based aggregate computation
• On optimal solutions to the problem of gossiping in minimum time
• Optimal gossiping in paths and cycles
• Optimal gossip with direct addressing
• A Generalized Gossip Algorithm on Convex Metric Spaces
• The partial gossiping problem
• Order optimal information spreading using algebraic gossip

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 Q4457548)