ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1309.6603
  4. Cited By
The Random Bit Complexity of Mobile Robots Scattering
v1v2 (latest)

The Random Bit Complexity of Mobile Robots Scattering

25 September 2013
Quentin Bramas
Sébastien Tixeuil
ArXiv (abs)PDFHTML

Papers citing "The Random Bit Complexity of Mobile Robots Scattering"

5 / 5 papers shown
Title
An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous
  Robots on Grids
An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous Robots on Grids
Sayaka Kamei
Sébastien Tixeuil
49
7
0
07 Dec 2020
Randomized Gathering of Asynchronous Mobile Robots
Randomized Gathering of Asynchronous Mobile Robots
D. Pattanayak
John E. Augustine
P. Mandal
29
2
0
22 Sep 2019
Asynchronous Scattering
Asynchronous Scattering
Ulysse Léchine
Sébastien Tixeuil
13
0
0
22 May 2019
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited
  Visibility and its Applications
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and its Applications
Giuseppe A. Di Luna
P. Flocchini
Nicola Santoro
Giovanni Viglietta
22
11
0
26 Sep 2017
Fault-Induced Dynamics of Oblivious Robots on a Line
Fault-Induced Dynamics of Oblivious Robots on a Line
J. Carufel
P. Flocchini
25
1
0
11 Jul 2017
1