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

Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots

(2013) Taisuke Izumi et al.   IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

(2012) Paola Flocchini et al.   ALGORITHMICA

Deterministic rendezvous in networks: A comprehensive survey

(2012) Andrzej Pelc   NETWORKS

Energy-efficient strategies for building short chains of mobile robots locally

(2012) Philipp Brandes et al.   THEORETICAL COMPUTER SCIENCE

Tree exploration with logarithmic memory

(2011) Christoph Ambühl et al.   ACM Transactions on Algorithms

The cost of probabilistic agreement in oblivious robot networks

(2010) Julien Clement 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

Label-guided graph exploration by a finite automaton

(2008) Reuven Cohen et al.   ACM Transactions on Algorithms

Anonymous graph exploration without collision by mobile robots

(2008) Roberto Baldoni et al.   INFORMATION PROCESSING LETTERS

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