-
Hardness and Approximation Results for Black Hole Search in Arbitrary Networks
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node without leaving any trace. The... -
Formal verification of Mobile Robot Protocols
Mobile robot networks emerged in the past few years as a promising distributed computing model. Existing work in the literature typically ensures the correctness of... -
Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network
Computing with mobile agents is rapidly becoming a topic of mainstream research in the theory of distributed computing. The main research questions undertaken in this... -
Does Adding More Agents Make a Difference? A Case Study of Cover Time for the...
International audience
