main-content

## Distributed Computing OnlineFirst articles

13.09.2019

### Meeting in a polygon by anonymous oblivious robots

The Meeting problem for $$k\ge 2$$ k ≥ 2 searchers in a polygon P (possibly with holes) consists in making the searchers move within P, according to a distributed algorithm, in such a way that at least two of them eventually come to see each …

04.09.2019

### A complexity-based classification for multiprocessor synchronization

For many years, Herlihy’s elegant computability-based Consensus Hierarchy has been our best explanation of the relative power of various objects. Since real multiprocessors allow the different instructions they support to be applied to any memory …

07.08.2019 Open Access

### Some lower bounds in dynamic networks with oblivious adversaries

This paper considers several closely-related problems in synchronous dynamic networks with oblivious adversaries, and proves novel $$\varOmega (d + \text{ poly }(m))$$ Ω ( d + poly ( m ) ) lower bounds on their time complexity (in rounds). Here d …

06.08.2019

### Self-stabilizing gathering of mobile robots under crash or Byzantine faults

Gathering is a fundamental coordination problem in cooperative mobile robotics. In short, given a set of robots with arbitrary initial locations and no initial agreement on a global coordinate system, gathering requires that all robots, following …

01.08.2019

### Lower bounds for searching robots, some faulty

Suppose we are sending out k robots from 0 to search the real line at constant speed (with turns) to find a target at an unknown location; f of the robots are faulty, meaning that they fail to report the target although visiting its location …

## Aktuelle Ausgaben

### Über diese Zeitschrift

The international journal Distributed Computing provides a forum for original and significant contributions to the theory, design, specification, and implementation of distributed systems. Topics covered by the journal include but are not limited to: design and analysis of distributed algorithms; multiprocessor and multicore architectures and algorithms; synchronization protocols and concurrent programming; distributed operating systems and middleware; fault-tolerance, reliability, and availability; architectures and protocols for communication networks and peer-to-peer systems; security in distributed computing, cryptographic protocols; mobile, sensor, and ad hoc networks; internet applications; concurrency theory; and specification, semantics, verification, and testing of distributed systems. In general, only original papers will be considered. Papers previously presented in conference proceedings may be submitted in enhanced form. If a paper has appeared previously, in any form, the authors must clearly indicate this and provide an account of the differences between the previously appeared form and the submission.

Weitere Informationen