Yoann Dieudonné

Algorithmica, October, 2023

Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, July, 2023

Want to Gather? No Need to Chatter!

[BibT_eX]

[DOI]

Sébastien Bouchard

SIAM J. Comput., April, 2023

Meeting in Harsh Conditions.

[BibT_eX]

[DOI]

, 2023

2022

Byzantine gathering in polynomial time.

[BibT_eX]

[DOI]

Sébastien Bouchard

Anissa Lamani

Distributed Comput., 2022

2021

Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Deterministic Treasure Hunt in the Plane with Angular Hints.

[BibT_eX]

[DOI]

Algorithmica, 2020

Almost Universal Anonymous Rendezvous in the Plane.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019

Explicit Communication Among Stigmergic Robots.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

Asynchronous approach in the plane: a deterministic polynomial algorithm.

[BibT_eX]

[DOI]

Distributed Comput., 2019

Impact of Knowledge on Election Time in Anonymous Networks.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

On deterministic rendezvous at a node of agents with arbitrary velocities.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

2016

Rendezvous in networks in spite of delay faults.

[BibT_eX]

[DOI]

Distributed Comput., 2016

Byzantine gathering in networks.

[BibT_eX]

[DOI]

Sébastien Bouchard

Bertrand Ducourthial

Distributed Comput., 2016

Anonymous Meeting in Networks.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

How to Meet Asynchronously at Polynomial Cost.

[BibT_eX]

[DOI]

Vincent Villain

SIAM J. Comput., 2015

Deterministic polynomial approach in the plane.

[BibT_eX]

[DOI]

Distributed Comput., 2015

2014

Price of asynchrony in mobile agents computing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Gathering Despite Mischief.

[BibT_eX]

[DOI]

David Peleg

ACM Trans. Algorithms, 2014

Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

Fault-Tolerant Rendezvous in Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Deterministic geoleader election in disoriented anonymous systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

2012

Self-stabilizing gathering with strong multiplicity detection.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Deterministic network exploration by a single agent with Byzantine tokens.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Deterministic Leader Election Among Disoriented Anonymous Sensors

[BibT_eX]

[DOI]

CoRR, 2012

COL: A data collection protocol for VANET.

[BibT_eX]

[DOI]

Bertrand Ducourthial

Sidi-Mohammed Senouci

Proceedings of the 2012 IEEE Intelligent Vehicles Symposium, 2012

2011

Deterministic gathering of anonymous agents in arbitrary networks

[BibT_eX]

[DOI]

CoRR, 2011

2010

Deterministic Robot-Network Localization is Hard.

[BibT_eX]

[DOI]

Ouiddad Labbani-Igbida

IEEE Trans. Robotics, 2010

Leader Election Problem versus Pattern Formation Problem.

[BibT_eX]

[DOI]

Vincent Villain

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Brief announcement: leader election vs pattern formation.

[BibT_eX]

[DOI]

Vincent Villain

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

Scatter of Robots.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2009

Self-stabilizing Determinsitic Gathering

[BibT_eX]

[DOI]

CoRR, 2009

Deaf, Dumb, and Chatting Robots, Enabling Distributed Computation and Fault-Tolerance Among Stigmergic Robot

[BibT_eX]

[DOI]

CoRR, 2009

Brief announcement: deaf, dumb, and chatting robots.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Deaf, Dumb, and Chatting Asynchronous Robots.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Self-stabilizing Deterministic Gathering.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008

Circle formation of weak mobile robots.

[BibT_eX]

[DOI]

Ouiddad Labbani-Igbida

ACM Trans. Auton. Adapt. Syst., 2008

Squaring the Circle with Weak Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

On the solvability of the localization problem in robot networks.

[BibT_eX]

[DOI]

Ouiddad Labbani-Igbida

Proceedings of the 2008 IEEE International Conference on Robotics and Automation, 2008

2007

Circle formation of weak robots and Lyndon words.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Scatter of Weak Robots

[BibT_eX]

[DOI]

CoRR, 2007

Swing Words to Make Circle Formation Quiescent.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2007

Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Robots and Demons (The Code of the Origins).

[BibT_eX]

[DOI]