Zohir Bouzid

Pierre Sutra

Theor. Comput. Sci., 2022

2018

Anonymous obstruction-free (n, k)-set agreement with n-k+1 atomic read/write registers.

[BibT_eX]

[DOI]

Michel Raynal

Pierre Sutra

Distributed Comput., 2018

2016

A necessary condition for Byzantine k-set agreement.

[BibT_eX]

[DOI]

Damien Imbs

Michel Raynal

Inf. Process. Lett., 2016

Anonymity-Preserving Failure Detectors.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015

Minimal Synchrony for Byzantine Consensus.

[BibT_eX]

[DOI]

Achour Mostéfaoui

Michel Raynal

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2014

Live Equals Fast in Iterated Models.

[BibT_eX]

[DOI]

Eli Gafni

Petr Kuznetsov

CoRR, 2014

Strong Equivalence Relations for Iterated Models.

[BibT_eX]

[DOI]

Eli Gafni

Petr Kuznetsov

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013

Certified Impossibility Results for Byzantine-Tolerant Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Parallel Consensus is Harder than Set Agreement in Message Passing.

[BibT_eX]

[DOI]

Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

Gathering of Mobile Robots Tolerating Multiple Crash Faults.

[BibT_eX]

[DOI]

Shantanu Das

Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

2012

Wait-Free Gathering of Mobile Robots

[BibT_eX]

[DOI]

Shantanu Das

CoRR, 2012

Brief Announcement: Anonymity, Failures, Detectors and Consensus.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Brief Announcement: Wait-Free Gathering of Mobile Robots.

[BibT_eX]

[DOI]

Shantanu Das

Proceedings of the Distributed Computing - 26th International Symposium, 2012

2011

The BG-simulation for Byzantine Mobile Robots

[BibT_eX]

[DOI]

CoRR, 2011

Brief Announcement: The BG-Simulation for Byzantine Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Robot Networks with Homonyms: The Case of Patterns Formation.

[BibT_eX]

[DOI]

Anissa Lamani

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Anonymous Agreement: The Janus Algorithm.

[BibT_eX]

[DOI]

Pierre Sutra

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

2010

Optimal Byzantine-resilient convergence in uni-dimensional robot networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

(anti-Omegax ×Sigmaz)-Based k-Set Agreement Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

RoboCast: Asynchronous Communication in Robot Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009

Byzantine Convergence in Robots Networks: The Price of Asynchrony

[BibT_eX]

[DOI]

Maria Potop-Butucaru

CoRR, 2009

Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks

[BibT_eX]

[DOI]

CoRR, 2009

Optimal byzantine resilient convergence in oblivious robot networks

[BibT_eX]

[DOI]

Maria Potop-Butucaru

CoRR, 2009

Optimal Byzantine Resilient Convergence in Asynchronous Robots Networks.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2009

Byzantine Convergence in Robot Networks: The Price of Asynchrony.

[BibT_eX]

[DOI]

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

Byzantine-Resilient Convergence in Oblivious Robot Networks.

[BibT_eX]

[DOI]