Damien Imbs

According to our database1, Damien Imbs authored at least 47 papers between 2008 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms.
Proceedings of the Structural Information and Communication Complexity, 2022

2021
Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects.
Theor. Comput. Sci., 2021

2020
Leader-based de-anonymization of an anonymous read/write memory.
Theor. Comput. Sci., 2020

From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019
Mutex-based Desanonymization of an Anonymous Read/Write Memory.
CoRR, 2019

Anonymous Read/Write Memory: Leader Election and De-anonymization.
Proceedings of the Structural Information and Communication Complexity, 2019

Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Mutex-Based De-anonymization of an Anonymous Read/Write Memory.
Proceedings of the Networked Systems - 7th International Conference, 2019

2018
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version).
CoRR, 2017

Which Broadcast Abstraction Captures k-Set Agreement?.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Progress-Space Tradeoffs in Single-Writer Memory Implementations.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

2016
Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects.
SIAM J. Comput., 2016

Trading off <i>t</i>-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast.
Parallel Process. Lett., 2016

Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems.
J. Parallel Distributed Comput., 2016

A necessary condition for Byzantine k-set agreement.
Inf. Process. Lett., 2016

Topological Methods in Distributed Computing (Dagstuhl Seminar 16282).
Dagstuhl Reports, 2016

Are Byzantine Failures Really Different from Crash Failures?
Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015
Failure detectors in homonymous distributed systems (with an application to consensus).
J. Parallel Distributed Comput., 2015

From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach.
CoRR, 2015

Simple and Efficient Reliable Broadcast in the Presence of Byzantine Processes.
CoRR, 2015

Untangling Partial Agreement: Iterated x-consensus Simulations.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

The Synchronization Power of Atomic Bitwise Operations.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

2014
Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems.
Proceedings of the Structural Information and Communication Complexity, 2014

2013
The weakest failure detector to implement a register in asynchronous systems with hybrid communication.
Theor. Comput. Sci., 2013

Towards a universal construction for transaction-based multiprocess programs.
Theor. Comput. Sci., 2013

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).
PhD thesis, 2012

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

Help when needed, but no more: Efficient read/write partial snapshot.
J. Parallel Distributed Comput., 2012

Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Trying to Unify the LL/SC Synchronization Primitive and the Notion of a Timed Register.
Proceedings of the IEEE 26th International Conference on Advanced Information Networking and Applications, 2012

2011
Software transactional memories: an approach for multicore programming.
J. Supercomput., 2011

A liveness condition for concurrent objects: <i>x</i>-wait-freedom.
Concurr. Comput. Pract. Exp., 2011

Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

The Universe of Symmetry Breaking Tasks.
Proceedings of the Structural Information and Communication Complexity, 2011

A Simple Snapshot Algorithm for Multicore Systems.
Proceedings of the 5th Latin-American Symposium on Dependable Computing, 2011

Read Invisibility, Virtual World Consistency and Probabilistic Permissiveness are Compatible.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2011

2010
On Adaptive Renaming under Eventually Limited Contention.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

On asymmetric progress conditions.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

The multiplicative power of consensus numbers.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

The <i>x</i>-Wait-Freedom Progress Condition.
Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009
A note on atomicity: Boosting Test&Set to solve consensus.
Inf. Process. Lett., 2009

Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation.
Proceedings of the Stabilization, 2009

A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition.
Proceedings of the Structural Information and Communication Complexity, 2009

Brief announcement: virtual world consistency: a new condition for STM systems.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early Abort.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

2008
A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008


  Loading...