A unified approach for gathering and exclusive searching on rings under weak assumptions

Gathering of oblivious robots on infinite grids with minimum traveled distance

(2017) Gabriele Di Stefano et al.   INFORMATION AND COMPUTATION

Gathering of robots on anonymous grids and trees without multiplicity detection

(2016) Gianlorenzo D'Angelo et al.   THEORETICAL COMPUTER SCIENCE

Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks

(2014) Gianlorenzo D’Angelo et al.   ALGORITHMICA

Gathering on rings under the Look–Compute–Move model

(2014) Gianlorenzo D’Angelo et al.   DISTRIBUTED COMPUTING

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

(2012) Paola Flocchini et al.   ALGORITHMICA

Distributed Computing by Mobile Robots: Gathering

(2012) Mark Cieliebak et al.   SIAM JOURNAL ON COMPUTING

The Gathering Problem for Two Oblivious Robots with Unreliable Compasses

(2012) Taisuke Izumi et al.   SIAM JOURNAL ON COMPUTING

How many oblivious robots can explore a line

(2011) Paola Flocchini et al.   INFORMATION PROCESSING LETTERS

Remembering without memory: Tree exploration by asynchronous oblivious robots

(2010) Paola Flocchini et al.   THEORETICAL COMPUTER SCIENCE

Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring

(2010) Ralf Klasing et al.   THEORETICAL COMPUTER SCIENCE

The cost of monotonicity in distributed graph searching

(2009) David Ilcinkas et al.   DISTRIBUTED COMPUTING

An annotated bibliography on guaranteed graph searching

(2008) Fedor V. Fomin et al.   THEORETICAL COMPUTER SCIENCE

Gathering few fat mobile robots in the plane

(2008) Jurek Czyzowicz et al.   THEORETICAL COMPUTER SCIENCE

Gathering asynchronous oblivious mobile robots in a ring

(2007) Ralf Klasing et al.   THEORETICAL COMPUTER SCIENCE