On fast and robust information spreading in the vertex-congest model (Q1625611): Difference between revisions

From MaRDI portal
Merged Item from Q3460721
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Network information flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed connectivity decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast and robust information spreading in the vertex-congest model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3546780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover Time and Broadcast Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized broadcast in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing network coding gossip made easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Random Linear Network Coding Approach to Multicast / rank
 
Normal rank
Property / cites work
 
Property / cites work: The abstract MAC layer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear network coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank

Revision as of 07:59, 11 July 2024

scientific article; zbMATH DE number 6527695
  • On Fast and Robust Information Spreading in the Vertex-Congest Model
Language Label Description Also known as
English
On fast and robust information spreading in the vertex-congest model
scientific article; zbMATH DE number 6527695
  • On Fast and Robust Information Spreading in the Vertex-Congest Model

Statements

On fast and robust information spreading in the vertex-congest model (English)
0 references
On Fast and Robust Information Spreading in the Vertex-Congest Model (English)
0 references
0 references
0 references
0 references
0 references
29 November 2018
0 references
8 January 2016
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
distributed computing
0 references
information spreading
0 references
randomized algorithms
0 references
vertex-connectivity
0 references
fault tolerance
0 references
0 references
0 references
0 references