Robust gossiping with an application to consensus (Q856404): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Bogdan S. Chlebus / rank
Normal rank
 
Property / author
 
Property / author: Bogdan S. Chlebus / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2006.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008636585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the message complexity of binary Byzantine agreement under crash failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information dissemination in distributed systems with faulty units / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Telephone Problems with Failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast gossiping with short unreliable messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on information exchange for Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performing Work Efficiently in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Tolerance in Networks of Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the time to assure interactive consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods and problems of communication in usual networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Byzantine Agreement for <i>n</i> &gt; 3<i>t</i> Processors in <i>t</i> + 1 Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient gossip and robust distributed computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Message-optimal protocols for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource discovery in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of gossiping and broadcasting in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatial gossip and resource location protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / 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: Tolerating a linear number of faults in networks of bounded degree / rank
 
Normal rank

Latest revision as of 10:21, 25 June 2024

scientific article
Language Label Description Also known as
English
Robust gossiping with an application to consensus
scientific article

    Statements

    Robust gossiping with an application to consensus (English)
    0 references
    0 references
    0 references
    7 December 2006
    0 references
    distributed algorithm
    0 references
    crash failure
    0 references
    message passing
    0 references
    synchrony
    0 references
    gossiping
    0 references
    consensus
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers