Random walks on graphs are an essential primitive for many randomised algorithms and
stochastic processes. It is natural to ask how much can be gained by running multiple …

Motivated by the Lévy foraging hypothesis--the premise that various animal species have
adapted to follow Lévy walks to optimize their search efficiency--we study the parallel hitting …

The paper formalizes a version of parallel online directed acyclic graph (DAG) exploration,
general enough to be readily mapped to many computational scenarios. In both the offline …

The multiple random walkers mechanism is revisited in this paper for service discovery
purposes considering modern dynamic network environments like the Internet of Things …

We consider several algorithms for exploring and filling an unknown, connected region, by
simple, airborne agents. The agents are assumed to be identical, autonomous, anonymous …

In the treasure hunt problem, a team of mobile agents need to locate a single treasure that is
hidden in their environment. We consider the problem in the discrete setting of an oriented …

The multiple random walkers mechanism is revisited in this paper for service discovery
purposes considering modern dynamic network environments like fog computing, where …

In recent years there has been a surge of interest on behalf of the algorithmic community in
applying its theoretical tools to the understanding of complex systems, in particular …

Résumé Récemment, la communauté algorithmique a manifesté un intérêt croissant pour
l'utilisation de ses outils théoriques à la compréhension des systèmes complexes …

Στη διάρκεια των τελευταίων δεκαετιών έχει αναπτυχθεί μεγάλος αριθμός Ασύρματων Δικτύων
Αισθητήρων για την αποτύπωση των συνθηκών που επικρατούν στους χώρους όπου είναι …