A tight lower bound for semi-synchronous collaborative grid exploration

Distributed Computing, pp. 471-484, 2020.

Cited by: 10|Bibtex|Views54|DOI:https://doi.org/10.1007/s00446-020-00369-0
EI
Other Links: academic.microsoft.com|link.springer.com|dblp.uni-trier.de

Abstract:

Recently, there has been a growing interest in grid exploration by agents with limited capabilities. We show that the grid cannot be explored by three semi-synchronous finite automata, answering an open question by Emek et al. (Theor Comput Sci 608:255–267, 2015) in the negative. In the setting we consider, time is divided into discrete s...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments