Byzantine-Resilient Convergence in Oblivious Robot Networks. - Zohir Bouzid; Maria Gradinariu Potop-Butucaru; Sébastien Tixeuil (ICDCN, 2009)

Byzantine Convergence in Robot Networks: The Price of Asynchrony. - Zohir Bouzid; Maria Gradinariu Potop-Butucaru; Sébastien Tixeuil (OPODIS, 2009)

Optimal Byzantine Resilient Convergence in Asynchronous Robots Networks. - Zohir Bouzid; Maria Gradinariu Potop-Butucaru; Sébastien Tixeuil (SSS, 2009)

Optimal byzantine resilient convergence in oblivious robot networks - Zohir Bouzid; Maria Potop-Butucaru; Sébastien Tixeuil (CoRR, 2009)

Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks - Zohir Bouzid; Maria Gradinariu Potop-Butucaru; Sébastien Tixeuil (CoRR, 2009)

Byzantine Convergence in Robots Networks: The Price of Asynchrony - Zohir Bouzid; Maria Potop-Butucaru; Sébastien Tixeuil (CoRR, 2009)

RoboCast: Asynchronous Communication in Robot Networks. - Zohir Bouzid; Shlomi Dolev; Maria Potop-Butucaru; Sébastien Tixeuil (OPODIS, 2010)

(anti-Omegax ×Sigmaz)-Based k-Set Agreement Algorithms. - Zohir Bouzid; Corentin Travers (OPODIS, 2010)

Optimal Byzantine-resilient convergence in uni-dimensional robot networks. - Zohir Bouzid; Maria Gradinariu Potop-Butucaru; Sébastien Tixeuil (Theor. Comput. Sci., 2010)

Anonymous Agreement: The Janus Algorithm. - Zohir Bouzid; Pierre Sutra; Corentin Travers (OPODIS, 2011)

Robot Networks with Homonyms: The Case of Patterns Formation. - Zohir Bouzid; Anissa Lamani (SSS, 2011)

Brief Announcement: The BG-Simulation for Byzantine Mobile Robots. - Taisuke Izumi; Zohir Bouzid; Sébastien Tixeuil; Koichi Wada 001 (DISC, 2011)

The BG-simulation for Byzantine Mobile Robots - Taisuke Izumi; Zohir Bouzid; Sébastien Tixeuil; Koichi Wada 001 (CoRR, 2011)

Brief Announcement: Wait-Free Gathering of Mobile Robots. - Zohir Bouzid; Shantanu Das 001; Sébastien Tixeuil (DISC, 2012)

Brief Announcement: Anonymity, Failures, Detectors and Consensus. - Zohir Bouzid; Corentin Travers (DISC, 2012)

Wait-Free Gathering of Mobile Robots - Zohir Bouzid; Shantanu Das 001; Sébastien Tixeuil (CoRR, 2012)

Gathering of Mobile Robots Tolerating Multiple Crash Faults. - Zohir Bouzid; Shantanu Das 001; Sébastien Tixeuil (ICDCS, 2013)

Parallel Consensus is Harder than Set Agreement in Message Passing. - Zohir Bouzid; Corentin Travers (ICDCS, 2013)

Certified Impossibility Results for Byzantine-Tolerant Mobile Robots. - Cédric Auger; Zohir Bouzid; Pierre Courtieu; Sébastien Tixeuil; Xavier Urbain (SSS, 2013)

Strong Equivalence Relations for Iterated Models. - Zohir Bouzid; Eli Gafni; Petr Kuznetsov (OPODIS, 2014)

Live Equals Fast in Iterated Models. - Zohir Bouzid; Eli Gafni; Petr Kuznetsov (CoRR, 2014)

Minimal Synchrony for Byzantine Consensus. - Zohir Bouzid; Achour Mostéfaoui; Michel Raynal (PODC, 2015)

Anonymity-Preserving Failure Detectors. - Zohir Bouzid; Corentin Travers (DISC, 2016)

A necessary condition for Byzantine k-set agreement. - Zohir Bouzid; Damien Imbs; Michel Raynal (Inf. Process. Lett., 2016)

Anonymous obstruction-free (n, k)-set agreement with n-k+1 atomic read/write registers. - Zohir Bouzid; Michel Raynal; Pierre Sutra (Distributed Comput., 2018)

Agreeing within a few writes. - Zohir Bouzid; Pierre Sutra; Corentin Travers (Theor. Comput. Sci., 2022)