Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems. - Achour Mostéfaoui; Michel Raynal; Julien Stainer (SSS, 2011)

A Simple Asynchronous Shared Memory Consensus Algorithm Based on Omega and Closing Sets. - Michel Raynal; Julien Stainer (CISIS, 2012)

From a Store-Collect Object and Ω to Efficient Asynchronous Consensus. - Michel Raynal; Julien Stainer (Euro-Par, 2012)

Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems. - Achour Mostéfaoui; Michel Raynal; Julien Stainer (NCA, 2012)

When and How Process Groups Can Be Used to Reduce the Renaming Space. - Armando Castañeda; Michel Raynal; Julien Stainer (OPODIS, 2012)

Brief announcement: increasing the power of the iterated immediate snapshot model with failure detectors. - Michel Raynal; Julien Stainer (PODC, 2012)

Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors. - Michel Raynal; Julien Stainer (SIROCCO, 2012)

Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors. - Michel Raynal; Julien Stainer (PODC, 2013)

Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems. - Michel Raynal; Julien Stainer (SIROCCO, 2013)

Trust-aware peer sampling: Performance and privacy tradeoffs. - Davide Frey; Arnaud Jégou; Anne-Marie Kermarrec; Michel Raynal; Julien Stainer (Theor. Comput. Sci., 2013)

A Simple Broadcast Algorithm for Recurrent Dynamic Systems. - Michel Raynal; Julien Stainer; Jiannong Cao 001; Weigang Wu (AINA, 2014)

Computing in the Presence of Concurrent Solo Executions. - Maurice Herlihy; Sergio Rajsbaum; Michel Raynal; Julien Stainer (LATIN, 2014)

Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties. - Michel Raynal; Julien Stainer; Gadi Taubenfeld (PODC, 2014)

Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems. - Damien Imbs; Sergio Rajsbaum; Michel Raynal; Julien Stainer (SIROCCO, 2014)

From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach. - Damien Imbs; Michel Raynal; Julien Stainer (CoRR, 2015)

Computability Abstractions for Fault-tolerant Asynchronous Distributed Computing. (Abstractions pour la calculabilité dans les systèmes répartis asynchrones tolérant les défaillances). - Julien Stainer (2015)

Are Byzantine Failures Really Different from Crash Failures? - Damien Imbs; Michel Raynal; Julien Stainer (DISC, 2016)

Distributed Universality. - Michel Raynal; Julien Stainer; Gadi Taubenfeld (Algorithmica, 2016)

Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems. - Damien Imbs; Sergio Rajsbaum; Michel Raynal; Julien Stainer (J. Parallel Distributed Comput., 2016)

Sequential Proximity - Towards Provably Scalable Concurrent Search Algorithms. - Karolos Antoniadis; Rachid Guerraoui; Julien Stainer; Vasileios Trigonakis (NETYS, 2017)

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)

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

From wait-free to arbitrary concurrent solo executions in colorless distributed computing. - Maurice Herlihy; Sergio Rajsbaum; Michel Raynal; Julien Stainer (Theor. Comput. Sci., 2017)

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