Fault-tolerant graph realizations in the congested clique (Q6112001): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4312347427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity of Byzantine Agreement, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizing Degree Sequences in Parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skip graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Message Bounds for Randomized Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of faults on network expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed symmetry-breaking algorithms for congested cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impact of locality on the detection of cycles in the broadcast congested clique model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eccentric sequences and eccentric sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Byzantine agreement in the full-information model in O(log n) rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximate shortest paths in the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust gossiping with an application to consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast scalable deterministic consensus for crash failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of the congested clique model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3287781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congested Clique Algorithms for the Minimum Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: MST in Log-Star Rounds of Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the existence of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and minimum cut approximation in the broadcast congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Byzantine Agreement in Expected Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eccentric sequences in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The round complexity of distributed sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Message-Passing Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerating linear number of faults in networks of bounded degree / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:00, 2 August 2024

scientific article; zbMATH DE number 7722895
Language Label Description Also known as
English
Fault-tolerant graph realizations in the congested clique
scientific article; zbMATH DE number 7722895

    Statements

    Fault-tolerant graph realizations in the congested clique (English)
    0 references
    4 August 2023
    0 references
    graph realizations
    0 references
    congested-clique
    0 references
    distributed algorithm
    0 references
    fault-tolerant algorithm
    0 references
    crash fault
    0 references
    time complexity
    0 references
    message complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers