Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Communication complexity of gossiping by packets

From MaRDI portal
Publication:1373799
Jump to:navigation, search

DOI10.1006/JPDC.1997.1357zbMath0888.68013OpenAlexW2031081633MaRDI QIDQ1373799

Adele A. Rescigno, Luisa Gargano, Ugo Vaccaro

Publication date: 17 December 1997

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1997.1357


zbMATH Keywords

gossiping algorithms


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)


Related Items (3)

Concurrent multicast in weighted networks ⋮ Concurrent multicast in weighted networks ⋮ Communication complexity of fault-tolerant information diffusion







This page was built for publication: Communication complexity of gossiping by packets

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1373799&oldid=13523577"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki