Algorithms with advice have received ample attention in the distributed and online settings,
and they have recently proven useful also in dynamic settings. In this work we study local …

We consider the fundamental task of graph exploration. An n-node graph has unlabeled
nodes, and all ports at any node of degree d are arbitrarily numbered 0,…, d− 1. A mobile …

Broadcast is one of the fundamental network communication primitives. One node of a
network, called the s ource, has a message that has to be learned by all other nodes. We …

Treasure hunt is finding an inert target by a mobile agent. We consider treasure hunt in
polygonal terrains with polygonal obstacles. The agent finds the treasure when there is a …

Exploration of an unknown network by one or multiple mobile entities is a well studied
problem which has various applications like treasure hunt, collecting data from some node …

In this work we study local computation with advice: the goal is to solve a graph problem $\Pi
$ with a distributed algorithm in $ f (\Delta) $ communication rounds, for some function $ f …

A mobile agent has to find an inert treasure hidden in the plane. Both the agent and the
treasure are modeled as points. This is a variant of the task known as treasure hunt. The …

Leader election is one of the basic problems in distributed computing. This is a symmetry
breaking problem: all nodes of a network must agree on a single node, called the leader. If …

We consider the problem of topology recognition in wireless (radio) networks modeled as
undirected graphs. Topology recognition is a fundamental task in which every node of the …

The number of nodes of a network, called its size, and the largest distance between nodes of
a network, called its diameter, are among the most important network parameters. Knowing …