Computing Time Complexity of Population Protocols with Cover Times - The ZebraNet Example. - Joffroy Beauquier; Peva Blanchard; Janna Burman; Sylvie Delaët (SSS, 2011)

Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs. - Joffroy Beauquier; Peva Blanchard; Janna Burman (OPODIS, 2013)

Self-Stabilizing Paxos - Peva Blanchard; Shlomi Dolev; Joffroy Beauquier; Sylvie Delaët (CoRR, 2013)

Tight complexity analysis of population protocols with cover times - The ZebraNet example. - Joffroy Beauquier; Peva Blanchard; Janna Burman; Sylvie Delaët (Theor. Comput. Sci., 2013)

Practically Self-stabilizing Paxos Replicated State-Machine. - Peva Blanchard; Shlomi Dolev; Joffroy Beauquier; Sylvie Delaët (NETYS, 2014)

Synchronization and Fault-tolerance in Distributed Algorithms. (Synchronisation et tolérance aux défaillances en algoritmique répartie). - Peva Blanchard (2014)

The Weakest Oracle for Symmetric Consensus in Population Protocols. - Joffroy Beauquier; Peva Blanchard; Janna Burman; Shay Kutten (ALGOSENSORS, 2015)

The Benefits of Entropy in Population Protocols. - Joffroy Beauquier; Peva Blanchard; Janna Burman; Rachid Guerraoui (OPODIS, 2015)

On the Power of Oracle varOmega ? for Self-Stabilizing Leader Election in Population Protocols. - Joffroy Beauquier; Peva Blanchard; Janna Burman; Oksana Denysyuk (SSS, 2016)

The Disclosure Power of Shared Objects. - Peva Blanchard; Rachid Guerraoui; Julien Stainer; Igor Zablotchi (NETYS, 2017)

Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent. - Peva Blanchard; El Mahdi El Mhamdi; Rachid Guerraoui; Julien Stainer (NIPS, 2017)

Brief Announcement: Byzantine-Tolerant Machine Learning. - Peva Blanchard; El Mahdi El Mhamdi; Rachid Guerraoui; Julien Stainer (PODC, 2017)

On the Smallest Grain of Salt to Get a Unique Identity. - Peva Blanchard; Rachid Guerraoui (SIROCCO, 2017)

Byzantine-Tolerant Machine Learning. - Peva Blanchard; El Mahdi El Mhamdi; Rachid Guerraoui; Julien Stainer (CoRR, 2017)

The entropy of a distributed computation random number generation from memory interleaving. - Karolos Antoniadis; Peva Blanchard; Rachid Guerraoui; Julien Stainer (Distributed Comput., 2018)

Generalizing while preserving monotonicity in comparison-based preference learning models. - Julien Fageot; Peva Blanchard; Gilles Bareilles; Lê-Nguyên Hoang (CoRR, 2025)

On Monotonicity in AI Alignment. - Gilles Bareilles; Julien Fageot; Lê-Nguyên Hoang; Peva Blanchard; Wassim Bouaziz; Sébastien Rouault; El-Mahdi El-Mhamdi (CoRR, 2025)