scientific article; zbMATH DE number 6297761
From MaRDI portal
Publication:5417681
zbMath1288.68026MaRDI QIDQ5417681
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15)
Related Items (7)
The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models ⋮ Fault-tolerant graph realizations in the congested clique ⋮ Brief Announcement: Improved Consensus in Quantum Networks ⋮ Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication ⋮ Leader election in well-connected graphs ⋮ Global synchronization and consensus using beeps in a fault-prone multiple access channel
This page was built for publication:
