ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 0807.1753
  4. Cited By
The cost of probabilistic gathering in oblivious robot networks

The cost of probabilistic gathering in oblivious robot networks

Information Processing Letters (IPL), 2008
10 July 2008
J. Clément
Xavier Défago
M. Potop-Butucaru
Stéphane Messika
ArXiv (abs)PDFHTML

Papers citing "The cost of probabilistic gathering in oblivious robot networks"

4 / 4 papers shown
An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous
  Robots on Grids
An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous Robots on GridsComputer/law journal (JITPL), 2020
Sayaka Kamei
Sébastien Tixeuil
317
12
0
07 Dec 2020
Asynchronous Scattering
Asynchronous Scattering
Ulysse Léchine
Sébastien Tixeuil
78
0
0
22 May 2019
Coding theory for noiseless channels realized by anonymous oblivious
  mobile robots
Coding theory for noiseless channels realized by anonymous oblivious mobile robots
Yukiko Yamauchi
M. Yamashita
166
0
0
21 May 2019
The Random Bit Complexity of Mobile Robots Scattering
The Random Bit Complexity of Mobile Robots ScatteringInternational Journal of Foundations of Computer Science (IJFCS), 2013
Quentin Bramas
Sébastien Tixeuil
129
7
0
25 Sep 2013
1
Page 1 of 1