| Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations) D Imbs, M Raynal Theoretical Computer Science, 2012 | 57 | 2012 |
| Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast D Imbs, M Raynal Parallel Processing Letters 26 (04), 1650017, 2016 | 47 | 2016 |
| Help when needed, but no more: efficient read/write partial snapshot D Imbs, M Raynal Journal of Parallel and Distributed Computing 72 (1), 1-12, 2012 | 42 | 2012 |
| Failure detectors in homonymous distributed systems (with an application to consensus) S Arévalo, AF Anta, D Imbs, E Jiménez, M Raynal Journal of Parallel and Distributed Computing 83, 83-95, 2015 | 34 | 2015 |
| On asymmetric progress conditions D Imbs, M Raynal, G Taubenfeld Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010 | 32 | 2010 |
| Brief announcement: virtual world consistency: a new condition for stm systems D Imbs, JR de Mendivil, M Raynal Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009 | 32 | 2009 |
| The universe of symmetry breaking tasks D Imbs, S Rajsbaum, M Raynal Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011 | 28 | 2011 |
| Visiting gafni’s reduction land: From the bg simulation to the extended bg simulation D Imbs, M Raynal Stabilization, Safety, and Security of Distributed Systems: 11th …, 2009 | 27 | 2009 |
| The multiplicative power of consensus numbers D Imbs, M Raynal Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010 | 25 | 2010 |
| A lock-based STM protocol that satisfies opacity and progressiveness D Imbs, M Raynal Principles of Distributed Systems, 226-245, 2008 | 24 | 2008 |
| Towards a universal construction for transaction-based multiprocess programs T Crain, D Imbs, M Raynal Theoretical Computer Science 496, 154-169, 2013 | 23 | 2013 |
| Read/write shared memory abstraction on top of asynchronous byzantine message-passing systems D Imbs, S Rajsbaum, M Raynal, J Stainer Journal of Parallel and Distributed Computing 93, 1-9, 2016 | 21 | 2016 |
| Set-constrained delivery broadcast: Definition, abstraction power, and computability limits D Imbs, A Mostéfaoui, M Perrin, M Raynal Proceedings of the 19th International Conference on Distributed Computing …, 2018 | 20 | 2018 |
| Optimal memory-anonymous symmetric deadlock-free mutual exclusion Z Aghazadeh, D Imbs, M Raynal, G Taubenfeld, P Woelfel Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 19 | 2019 |
| Renaming is weaker than set agreement but for perfect renaming: A map of sub-consensus tasks A Castañeda, D Imbs, S Rajsbaum, M Raynal LATIN 2012: Theoretical Informatics: 10th Latin American Symposium, Arequipa …, 2012 | 19 | 2012 |
| Generalized symmetry breaking tasks and nondeterminism in concurrent objects A Castañeda, D Imbs, S Rajsbaum, M Raynal SIAM Journal on Computing 45 (2), 379-414, 2016 | 17 | 2016 |
| On the consistency conditions of transactional memories D Imbs, JRG de Mendivil Moreno, M Raynal | 17 | 2008 |
| A necessary condition for Byzantine k-set agreement Z Bouzid, D Imbs, M Raynal Information Processing Letters 116 (12), 757-759, 2016 | 16 | 2016 |
| Simple and efficient reliable broadcast in the presence of byzantine processes D Imbs, M Raynal arXiv preprint arXiv:1510.06882, 2015 | 16 | 2015 |
| Read invisibility, virtual world consistency and probabilistic permissiveness are compatible T Crain, D Imbs, M Raynal Algorithms and Architectures for Parallel Processing, 244-257, 2011 | 16 | 2011 |
m raynalProfessor of InformaticsBestätigte E-Mail-Adresse bei irisa.fr
