5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DS2009★ 5 cited
Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots
Stéphane Devismes, Franck Petit, Sébastien Tixeuil
We consider a team of identical, oblivious, asynchronous mobile robots that are able to sense (\emph{i.e.}, view) their environment, yet are unable to communicate, and evolve o…
cs.DM2008
Ascending runs in dependent uniformly distributed random variables: Application to wireless networks
Nathalie Mitton, Katy Paroux, Bruno Sericola +1
We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their depende…