Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Analyzing network coding (gossip) made easy

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

DOI10.1145/2629696zbMATH Open1426.68018OpenAlexW2507734872MaRDI QIDQ3177799FDOQ3177799

Bernhard Haeupler

Publication date: 2 August 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2629696




Recommendations

  • Analyzing network coding gossip made easy
  • Bounds for algebraic gossip on graphs
  • Faster information dissemination in dynamic networks via network coding
  • A Random Linear Network Coding Approach to Multicast
  • Simple, fast and deterministic gossip and rumor spreading


zbMATH Keywords

dynamic networksmulticastrandom linear network codinggossip


Mathematics Subject Classification ID

Network protocols (68M12)



Cited In (1)

  • Analyzing network coding gossip made easy





This page was built for publication: Analyzing network coding (gossip) made easy

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3177799&oldid=16274932"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:55. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki