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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
aliases / en / 0aliases / en / 0
 
On Fast and Robust Information Spreading in the Vertex-Congest Model
description / endescription / en
scientific article
scientific article; zbMATH DE number 6527695
Property / title
 
On Fast and Robust Information Spreading in the Vertex-Congest Model (English)
Property / title: On Fast and Robust Information Spreading in the Vertex-Congest Model (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1407.68184 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-25258-2_19 / rank
 
Normal rank
Property / published in
 
Property / published in: Structural Information and Communication Complexity / rank
 
Normal rank
Property / publication date
 
8 January 2016
Timestamp+2016-01-08T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 8 January 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6527695 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2704259994 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W844164545 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1507.01181 / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Simple, Fast and Deterministic Gossip and Rumor Spreading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing separable functions via gossip / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:23, 17 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
29 November 2018
0 references
8 January 2016
0 references
distributed computing
0 references
information spreading
0 references
randomized algorithms
0 references
vertex-connectivity
0 references
fault tolerance
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references