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

Periodic gossiping in commuted networks

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

DOI10.1007/s00224-004-1197-8zbMath1088.68012OpenAlexW2059170436MaRDI QIDQ705134

Dominique Barith, Pascal Berthomé

Publication date: 25 January 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-004-1197-8



Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)


Related Items (1)

Cayley graphs as classifiers for data mining: the influence of asymmetries




This page was built for publication: Periodic gossiping in commuted networks

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