A probabilistic characterization of a fault-tolerant gossiping algorithm (Q1044771): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11424-009-9149-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033459027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correctness of a gossip based membership protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatial gossip and resource location protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant broadcasting and gossiping in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility and complexity of broadcasting with random transmission failures / rank
 
Normal rank

Latest revision as of 07:46, 2 July 2024

scientific article
Language Label Description Also known as
English
A probabilistic characterization of a fault-tolerant gossiping algorithm
scientific article

    Statements

    A probabilistic characterization of a fault-tolerant gossiping algorithm (English)
    0 references
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    fault-tolerance
    0 references
    gossip
    0 references
    probabilistic broadcast
    0 references
    reliable multicast
    0 references

    Identifiers

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