A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness. - Damien Imbs; Michel Raynal (OPODIS, 2008)

Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early Abort. - Damien Imbs; Michel Raynal (ICDCN, 2009)

Brief announcement: virtual world consistency: a new condition for STM systems. - Damien Imbs; José Ramón González de Mendívil; Michel Raynal (PODC, 2009)

A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition. - Damien Imbs; Michel Raynal (SIROCCO, 2009)

Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation. - Damien Imbs; Michel Raynal (SSS, 2009)

A note on atomicity: Boosting Test&Set to solve consensus. - Damien Imbs; Michel Raynal (Inf. Process. Lett., 2009)

The x-Wait-Freedom Progress Condition. - Damien Imbs; Michel Raynal (Euro-Par (1), 2010)

The multiplicative power of consensus numbers. - Damien Imbs; Michel Raynal (PODC, 2010)

On asymmetric progress conditions. - Damien Imbs; Michel Raynal; Gadi Taubenfeld (PODC, 2010)

On Adaptive Renaming under Eventually Limited Contention. - Damien Imbs; Michel Raynal (SSS, 2010)

Read Invisibility, Virtual World Consistency and Probabilistic Permissiveness are Compatible. - Tyler Crain; Damien Imbs; Michel Raynal (ICA3PP (1), 2011)

A Simple Snapshot Algorithm for Multicore Systems. - Damien Imbs; Michel Raynal (LADC, 2011)

The Universe of Symmetry Breaking Tasks. - Damien Imbs; Sergio Rajsbaum; Michel Raynal (SIROCCO, 2011)

Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible. - Tyler Crain; Damien Imbs; Michel Raynal (SPAA, 2011)

A liveness condition for concurrent objects: x-wait-freedom. - Damien Imbs; Michel Raynal (Concurr. Comput. Pract. Exp., 2011)

Software transactional memories: an approach for multicore programming. - Damien Imbs; Michel Raynal (J. Supercomput., 2011)

Trying to Unify the LL/SC Synchronization Primitive and the Notion of a Timed Register. - Damien Imbs; Michel Raynal (AINA, 2012)

Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks. - Armando Castañeda; Damien Imbs; Sergio Rajsbaum; Michel Raynal (LATIN, 2012)

Help when needed, but no more: Efficient read/write partial snapshot. - Damien Imbs; Michel Raynal (J. Parallel Distributed Comput., 2012)

Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations). - Damien Imbs; Michel Raynal (Theor. Comput. Sci., 2012)

Calculabilité et conditions de progression des objets partagés en présence de défaillances. (Calculability and progress conditions of shared objects when facing crashes). - Damien Imbs (2012)

Towards a universal construction for transaction-based multiprocess programs. - Tyler Crain; Damien Imbs; Michel Raynal (Theor. Comput. Sci., 2013)

The weakest failure detector to implement a register in asynchronous systems with hybrid communication. - Damien Imbs; Michel Raynal (Theor. Comput. Sci., 2013)

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

The Synchronization Power of Atomic Bitwise Operations. - Damien Imbs (OPODIS, 2015)

Untangling Partial Agreement: Iterated x-consensus Simulations. - Damien Imbs; Sergio Rajsbaum; Adrián Valle (SSS, 2015)

Simple and Efficient Reliable Broadcast in the Presence of Byzantine Processes. - Damien Imbs; Michel Raynal (CoRR, 2015)

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

Failure detectors in homonymous distributed systems (with an application to consensus). - Sergio Arévalo; Antonio Fernández Anta; Damien Imbs; Ernesto Jiménez; Michel Raynal (J. Parallel Distributed Comput., 2015)

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

Topological Methods in Distributed Computing (Dagstuhl Seminar 16282). - Dmitry Feichtner-Kozlov; Damien Imbs (Dagstuhl Reports, 2016)

A necessary condition for Byzantine k-set agreement. - Zohir Bouzid; Damien Imbs; Michel Raynal (Inf. Process. Lett., 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)

Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast. - Damien Imbs; Michel Raynal (Parallel Process. Lett., 2016)

Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects. - Armando Castañeda; Damien Imbs; Sergio Rajsbaum; Michel Raynal (SIAM J. Comput., 2016)

Progress-Space Tradeoffs in Single-Writer Memory Implementations. - Damien Imbs; Petr Kuznetsov; Thibault Rieutord (OPODIS, 2017)

Which Broadcast Abstraction Captures k-Set Agreement?. - Damien Imbs; Achour Mostéfaoui; Matthieu Perrin; Michel Raynal (DISC, 2017)

Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version). - Damien Imbs; Achour Mostéfaoui; Matthieu Perrin; Michel Raynal (CoRR, 2017)

Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. - Damien Imbs; Achour Mostéfaoui; Matthieu Perrin; Michel Raynal (ICDCN, 2018)

Mutex-Based De-anonymization of an Anonymous Read/Write Memory. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (NETYS, 2019)

Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. - Zahra Aghazadeh; Damien Imbs; Michel Raynal; Gadi Taubenfeld; Philipp Woelfel (PODC, 2019)

Anonymous Read/Write Memory: Leader Election and De-anonymization. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (SIROCCO, 2019)

Mutex-based Desanonymization of an Anonymous Read/Write Memory. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (CoRR, 2019)

From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (PODC, 2020)

Leader-based de-anonymization of an anonymous read/write memory. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (Theor. Comput. Sci., 2020)

Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects. - Damien Imbs; Achour Mostéfaoui; Matthieu Perrin; Michel Raynal (Theor. Comput. Sci., 2021)

Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms. - Damien Imbs; Michel Raynal; Gadi Taubenfeld (SIROCCO, 2022)