Fault-tolerant graph realizations in the congested clique

DOI10.1007/978-3-031-22050-0_8arXiv2208.10135OpenAlexW4312347427MaRDI QIDQ6112001

No author found.

Publication date: 4 August 2023

Published in: Algorithmics of Wireless Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.10135

zbMATH Keywords

time complexityfault-tolerant algorithmdistributed algorithmmessage complexitycrash faultgraph realizationscongested-clique

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Wireless sensor networks as related to computer science (68M18)

Cites Work

• Robust gossiping with an application to consensus
• The effect of faults on network expansion
• Eccentric sequences in graphs
• Eccentric sequences and eccentric sets in graphs
• Distributed symmetry-breaking algorithms for congested cliques
• Connectivity and minimum cut approximation in the broadcast congested clique
• Fast approximate shortest paths in the congested clique
• The impact of locality on the detection of cycles in the broadcast congested clique model
• Byzantine agreement in the full-information model in O(log n) rounds
• The round complexity of distributed sorting
• On the power of the congested clique model
• Byzantine Agreement in Expected Polynomial Time
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Multi-Terminal Network Flows
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Distributed Computing: A Locality-Sensitive Approach
• Realizing Degree Sequences in Parallel
• “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
• Skip graphs
• Communication Complexity of Byzantine Agreement, Revisited
• Fast scalable deterministic consensus for crash failures
• Sublinear Message Bounds for Randomized Agreement
• Congested Clique Algorithms for the Minimum Cut Problem
• Fault-Tolerant Message-Passing Distributed Systems
• Tolerating linear number of faults in networks of bounded degree
• MST in Log-Star Rounds of Congested Clique
• Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fault-tolerant graph realizations in the congested clique