scientific article; zbMATH DE number 1306905
From MaRDI portal
Publication:4252758
zbMath0938.68658MaRDI QIDQ4252758
Alain Mayer, Mordechai M. Yung, Zvi Galil
Publication date: 26 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical problems of computer architecture (68M07)
Related Items (20)
Performing work in broadcast networks ⋮ Robust gossiping with an application to consensus ⋮ Dynamic load balancing with group communication ⋮ Communication Complexity of Wait-Free Computability in Dynamic Networks ⋮ 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 ⋮ Performing tasks on synchronous restartable message-passing processors ⋮ The complexity of synchronous iterative Do-All with crashes ⋮ Meeting the deadline: on the complexity of fault-tolerant continuous gossip ⋮ Emulating shared-memory do-all algorithms in asynchronous message-passing systems ⋮ Doing-it-all with bounded work and communication ⋮ Ordered and delayed adversaries and how to work against them on a shared channel ⋮ The Do-All problem with Byzantine processor failures ⋮ Fast agreement in networks with Byzantine nodes ⋮ A robust randomized algorithm to perform independent tasks ⋮ Randomization helps to perform independent tasks reliably ⋮ Cooperative computing with fragmentable and mergeable groups ⋮ Efficient gossip and robust distributed computation ⋮ Performing work with asynchronous processors: Message-delay-sensitive bounds
This page was built for publication:
