output
20122024
most citedA Unified Stochastic Model of Handover Measurement in Mobile Networks

11 citations

Showing cs.DCShow all

5 papers · 1 filter

cs.DC2019★ 6 cited

Rationals vs Byzantines in Consensus-based Blockchains

Yackolley Amoussou-Guenou, Bruno Biais, Maria Potop-Butucaru +1

In this paper we analyze from the game theory point of view Byzantine Fault Tolerant blockchains when processes exhibit rational or Byzantine behavior. Our work is the first to mod…

cs.DC2017

Parameterized Verification of Algorithms for Oblivious Robots on a Ring

Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru +1

We study verification problems for autonomous swarms of mobile robots that self-organize and cooperate to solve global objectives. In particular, we focus in this paper on the mode…

cs.DC2016★ 2 cited

Infinite Unlimited Churn

Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil

We study unlimited infinite churn in peer-to-peer overlay networks. Under this churn, arbitrary many peers may concurrently request to join or leave the overlay network; moreover t…

cs.DC2015★ 1 cited

Stateless Geocasting

Jordan Adamek, Mikhail Nesterenko, Sébastien Tixeuil

We present two stateless algorithms that guarantee to deliver the message to every device in a designated geographic area: flooding and planar geocasting. Due to the algorithms' st…

cs.DC2015★ 6 cited

A Certified Universal Gathering Algorithm for Oblivious Mobile Robots

Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil +1

We present a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any initial configuration that is not bivalent, using any number o…