output
20022025
most citedBalance and Abelian complexity of the Tribonacci word

36 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.DSShow all

4 papers · 1 filter

cs.DS2016★ 2 cited

Impact of Knowledge on Election Time in Anonymous Networks

Yoann Dieudonné, Andrzej Pelc

Leader election is one of the basic problems in distributed computing. For anonymous networks, the task of leader election is formulated as follows: every node v of the network mus…

cs.DS2014★ 16 cited

Rendezvous in Networks in Spite of Delay Faults

Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel +1

Two mobile agents, starting from different nodes of an unknown network, have to meet at the same node. Agents move in synchronous rounds using a deterministic algorithm. Each agent…

cs.DS2013★ 18 cited

How to Meet Asynchronously at Polynomial Cost

Yoann Dieudonné, Andrzej Pelc, Vincent Villain

Two mobile agents starting at different nodes of an unknown network have to meet. This task is known in the literature as rendezvous. Each agent has a different label which is a po…

cs.DS2011★ 6 cited

Anonymous Meeting in Networks

Yoann Dieudonné, Andrzej Pelc

A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node. Agents are…