scientific article; zbMATH DE number 2013838

zbMath1029.68519MaRDI QIDQ4437132

Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander A. Schwarzmann, Leszek Gąsieniec

Publication date: 7 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2508/25080295.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (8)

Performing work in broadcast networks ⋮ Robust gossiping with an application to consensus ⋮ Dealing with undependable workers in decentralized network supercomputing ⋮ 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 ⋮ Efficient gossip and robust distributed computation ⋮ Performing work with asynchronous processors: Message-delay-sensitive bounds

This page was built for publication: