Synchronous robots vs asynchronous lights-enhanced robots on graphs
type: Item
instance of: scholarly article
title: Synchronous robots vs asynchronous lights-enhanced robots on graphs
zbMATH Open document ID: 1345.68257
author: Mattia D'Emidio
author: Daniele Frigioni
author: Alfredo Navarra
publication date: 2016-08-05T00:00:00Z
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6609754
zbMATH Keywords: distributed algorithm
zbMATH Keywords: synchronicity
zbMATH Keywords: mobile robots
zbMATH Keywords: luminous robots
Wikidata QID: Q113317692
MaRDI profile type: Publication
full work available at URL: j.entcs.2016.03.012
OpenAlex ID: W2341715933
cites work: MinMax-Distance Gathering on Given Meeting Points
cites work: How to meet when you forget: log-space rendezvous in arbitrary graphs
cites work: Gathering on rings under the look-compute-move model
cites work: On the computational power of oblivious robots
cites work: Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots
cites work: Gathering of oblivious robots on infinite grids with minimum traveled distance
cites work: Optimal Gathering of Oblivious Robots in Anonymous Graphs
cites work: Gathering Despite Mischief
cites work: Exploring an unknown dangerous graph using tokens
cites work: Remembering without memory: tree exploration by asynchronous oblivious robots
cites work: Computing without communicating: ring exploration by asynchronous oblivious robots
cites work: Gathering of asynchronous robots with limited visibility
cites work: Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots
cites work: Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
DOI: 10.1016/J.ENTCS.2016.03.012
description: scientific article; zbMATH DE number 6609754