default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDamien Imbs
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c33]Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms. SIROCCO 2022: 174-190- [i12]Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms. CoRR abs/2203.02988 (2022) - 2021
- [j14]Damien Imbs, Achour Mostéfaoui, Matthieu Perrin
, Michel Raynal:
Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects. Theor. Comput. Sci. 886: 49-68 (2021) - 2020
- [j13]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Leader-based de-anonymization of an anonymous read/write memory. Theor. Comput. Sci. 836: 110-123 (2020) - [c32]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. PODC 2020: 41-50
2010 – 2019
- 2019
- [c31]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Mutex-Based De-anonymization of an Anonymous Read/Write Memory. NETYS 2019: 311-326 - [c30]Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel:
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. PODC 2019: 157-166 - [c29]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Anonymous Read/Write Memory: Leader Election and De-anonymization. SIROCCO 2019: 246-261 - [i11]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Mutex-based Desanonymization of an Anonymous Read/Write Memory. CoRR abs/1903.12204 (2019) - 2018
- [c28]Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. ICDCN 2018: 7:1-7:10 - [i10]Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel:
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. CoRR abs/1810.03723 (2018) - 2017
- [c27]Damien Imbs, Petr Kuznetsov, Thibault Rieutord:
Progress-Space Tradeoffs in Single-Writer Memory Implementations. OPODIS 2017: 9:1-9:17 - [c26]Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Which Broadcast Abstraction Captures k-Set Agreement?. DISC 2017: 27:1-27:16 - [i9]Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version). CoRR abs/1702.08176 (2017) - [i8]Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Which Broadcast Abstraction Captures $k$-Set Agreement? CoRR abs/1705.04835 (2017) - [i7]Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. CoRR abs/1706.05267 (2017) - [i6]Damien Imbs, Petr Kuznetsov, Thibault Rieutord:
Progress-Space Tradeoffs in Single-Writer Memory Implementations. CoRR abs/1709.01879 (2017) - 2016
- [j12]Zohir Bouzid, Damien Imbs, Michel Raynal:
A necessary condition for Byzantine k-set agreement. Inf. Process. Lett. 116(12): 757-759 (2016) - [j11]Damien Imbs, Sergio Rajsbaum, Michel Raynal, Julien Stainer:
Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems. J. Parallel Distributed Comput. 93-94: 1-9 (2016) - [j10]Damien Imbs, Michel Raynal:
Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast. Parallel Process. Lett. 26(4): 1650017:1-1650017:8 (2016) - [j9]Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal:
Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects. SIAM J. Comput. 45(2): 379-414 (2016) - [c25]Damien Imbs, Michel Raynal, Julien Stainer:
Are Byzantine Failures Really Different from Crash Failures? DISC 2016: 215-229 - [i5]Dmitry Feichtner-Kozlov, Damien Imbs:
Topological Methods in Distributed Computing (Dagstuhl Seminar 16282). Dagstuhl Reports 6(7): 31-41 (2016) - 2015
- [j8]Sergio Arévalo, Antonio Fernández Anta, Damien Imbs, Ernesto Jiménez, Michel Raynal:
Failure detectors in homonymous distributed systems (with an application to consensus). J. Parallel Distributed Comput. 83: 83-95 (2015) - [c24]Damien Imbs:
The Synchronization Power of Atomic Bitwise Operations. OPODIS 2015: 26:1-26:17 - [c23]Damien Imbs, Sergio Rajsbaum, Adrián Valle:
Untangling Partial Agreement: Iterated x-consensus Simulations. SSS 2015: 139-155 - [i4]Damien Imbs, Michel Raynal:
Simple and Efficient Reliable Broadcast in the Presence of Byzantine Processes. CoRR abs/1510.06882 (2015) - [i3]Damien Imbs, Michel Raynal, Julien Stainer:
From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach. CoRR abs/1510.09119 (2015) - [i2]Zohir Bouzid, Damien Imbs, Michel Raynal:
A Necessary Condition for Byzantine $k$-Set Agreement. CoRR abs/1512.06227 (2015) - 2014
- [c22]Damien Imbs, Sergio Rajsbaum, Michel Raynal, Julien Stainer:
Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems. SIROCCO 2014: 37-53 - 2013
- [j7]Tyler Crain, Damien Imbs, Michel Raynal:
Towards a universal construction for transaction-based multiprocess programs. Theor. Comput. Sci. 496: 154-169 (2013) - [j6]Damien Imbs, Michel Raynal:
The weakest failure detector to implement a register in asynchronous systems with hybrid communication. Theor. Comput. Sci. 512: 130-142 (2013) - 2012
- [b1]Damien Imbs:
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). University of Rennes 1, France, 2012 - [j5]Damien Imbs, Michel Raynal:
Help when needed, but no more: Efficient read/write partial snapshot. J. Parallel Distributed Comput. 72(1): 1-12 (2012) - [j4]Damien Imbs, Michel Raynal:
Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations). Theor. Comput. Sci. 444: 113-127 (2012) - [c21]Damien Imbs, Michel Raynal:
Trying to Unify the LL/SC Synchronization Primitive and the Notion of a Timed Register. AINA 2012: 326-330 - [c20]Tyler Crain, Damien Imbs, Michel Raynal:
Towards a Universal Construction for Transaction-Based Multiprocess Programs. ICDCN 2012: 61-75 - [c19]Sergio Arévalo, Antonio Fernández Anta, Damien Imbs, Ernesto Jiménez, Michel Raynal:
Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus). ICDCS 2012: 275-284 - [c18]Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal:
Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks. LATIN 2012: 145-156 - 2011
- [j3]Damien Imbs, Michel Raynal:
A liveness condition for concurrent objects: x-wait-freedom. Concurr. Comput. Pract. Exp. 23(17): 2154-2166 (2011) - [j2]Damien Imbs, Michel Raynal:
Software transactional memories: an approach for multicore programming. J. Supercomput. 57(2): 203-215 (2011) - [c17]Tyler Crain, Damien Imbs, Michel Raynal:
Read Invisibility, Virtual World Consistency and Probabilistic Permissiveness are Compatible. ICA3PP (1) 2011: 244-257 - [c16]Damien Imbs, Michel Raynal:
A Simple Snapshot Algorithm for Multicore Systems. LADC 2011: 17-24 - [c15]Damien Imbs, Sergio Rajsbaum, Michel Raynal:
The universe of symmetry breaking tasks. PODC 2011: 287-288 - [c14]Damien Imbs, Sergio Rajsbaum, Michel Raynal:
The Universe of Symmetry Breaking Tasks. SIROCCO 2011: 66-77 - [c13]Tyler Crain, Damien Imbs, Michel Raynal:
Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible. SPAA 2011: 315-316 - [c12]Damien Imbs, Michel Raynal:
The Weakest Failure Detector to Implement a Register in Asynchronous Systems with Hybrid Communication. SSS 2011: 268-282 - [i1]Sergio Arévalo, Antonio Fernández Anta, Damien Imbs, Ernesto Jiménez, Michel Raynal:
Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus). CoRR abs/1110.1842 (2011) - 2010
- [c11]Damien Imbs, Michel Raynal:
The x-Wait-Freedom Progress Condition. Euro-Par (1) 2010: 584-595 - [c10]Damien Imbs, Michel Raynal:
The multiplicative power of consensus numbers. PODC 2010: 26-35 - [c9]Damien Imbs, Michel Raynal, Gadi Taubenfeld:
On asymmetric progress conditions. PODC 2010: 55-64 - [c8]Damien Imbs, Michel Raynal:
On Adaptive Renaming under Eventually Limited Contention. SSS 2010: 377-387
2000 – 2009
- 2009
- [j1]Damien Imbs, Michel Raynal:
A note on atomicity: Boosting Test&Set to solve consensus. Inf. Process. Lett. 109(12): 589-591 (2009) - [c7]Damien Imbs, Michel Raynal:
Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early Abort. ICDCN 2009: 67-78 - [c6]Damien Imbs, Michel Raynal:
Software Transactional Memories: An Approach for Multicore Programming. PaCT 2009: 26-40 - [c5]Damien Imbs, José Ramón González de Mendívil, Michel Raynal:
Brief announcement: virtual world consistency: a new condition for STM systems. PODC 2009: 280-281 - [c4]Damien Imbs, Michel Raynal:
A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition. SIROCCO 2009: 266-280 - [c3]Damien Imbs, Michel Raynal:
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation. SSS 2009: 369-383 - [c2]Damien Imbs, Michel Raynal:
Help When Needed, But No More: Efficient Read/Write Partial Snapshot. DISC 2009: 142-156 - 2008
- [c1]Damien Imbs, Michel Raynal:
A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness. OPODIS 2008: 226-245
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
