Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel Raynal
Person information
- affiliation: IRISA Rennes
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j176]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
A Linearizability-based Hierarchy for Concurrent Specifications. Commun. ACM 66(1): 86-97 (2023)- [j175]Armando Castañeda
, Sergio Rajsbaum, Michel Raynal:
Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity. Distributed Comput. 36(2): 89-106 (2023) - [j174]Michel Raynal, Gadi Taubenfeld:
Corrigendum to "Mutual exclusion in fully anonymous shared memory systems" [Inf. Process. Lett. 158 (2020) 105938]. Inf. Process. Lett. 179: 106304 (2023) - [j173]Youcef Imine, Hicham Lakhlef, Michel Raynal, François Taïani:
DMCSC: a fully distributed multi-coloring approach for scalable communication in synchronous broadcast networks. J. Supercomput. 79(1): 788-813 (2023) - [c350]Michel Raynal:
About Informatics, Distributed Computing, and Our Job: A Personal View. SIROCCO 2023: 33-45 - [i46]Davide Frey, Mathieu Gestin, Michel Raynal:
The Synchronization Power (Consensus Number) of Access-Control Objects: The Case of AllowList and DenyList. CoRR abs/2302.06344 (2023) - [i45]Timothé Albouy, Davide Frey, Michel Raynal, François Taïani:
Good-case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case (Extended Version). CoRR abs/2303.05152 (2023) - 2022
- [j172]Michel Raynal, Gadi Taubenfeld:
Symmetry and Anonymity in Shared Memory Concurrent Systems. Bull. EATCS 136 (2022) - [j171]Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal:
Distributed computability: Relating k-immediate snapshot and x-set agreement. Inf. Comput. 285(Part): 104815 (2022) - [j170]Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Contention-related crash failures: Definitions, agreement algorithms, and impossibility results. Theor. Comput. Sci. 909: 76-86 (2022) - [j169]Michel Raynal, Gadi Taubenfeld:
A visit to mutual exclusion in seven dates. Theor. Comput. Sci. 919: 47-65 (2022) - [c349]Michel Raynal, Jie Wu:
Message from the General Chairs: MSN 2022. MSN 2022: xxvi - [c348]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
A Snapshot-Based Introduction to the Linearizability Hierarchy. NETYS 2022: 3-15 - [c347]Timothé Albouy, Davide Frey, Michel Raynal, François Taïani:
A Modular Approach to Construct Signature-Free BRB Algorithms Under a Message Adversary. OPODIS 2022: 26:1-26:23 - [c346]Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms. SIROCCO 2022: 174-190 - [c345]Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal, Mouna Safir:
Optimal Algorithms for Synchronous Byzantine k-Set Agreement. SSS 2022: 178-192 - [c344]Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Reaching Consensus in the Presence of Contention-Related Crash Failures. SSS 2022: 193-205 - [c343]Romaric Duvignau, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast. SSS 2022: 206-221 - [c342]Oskar Lundström, Michel Raynal, Elad Michael Schiller:
Brief Announcement: Self-stabilizing Total-Order Broadcast. SSS 2022: 358-363 - [c341]Timothé Albouy, Davide Frey, Michel Raynal, François Taïani:
Good-Case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case. DISC 2022: 4:1-4:22 - [i44]Romaric Duvignau, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Byzantine-tolerant Broadcast. CoRR abs/2201.12880 (2022) - [i43]Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms. CoRR abs/2203.02988 (2022) - [i42]Timothé Albouy, Davide Frey, Michel Raynal, François Taïani:
κ𝓁-cast: On the Foundations of Byzantine Reliable Broadcast in the Presence of Message Adversaries. CoRR abs/2204.13388 (2022) - [i41]Timothé Albouy, Davide Frey, Michel Raynal, François Taïani:
Asynchronous Byzantine Reliable Broadcast With a Message Adversary. CoRR abs/2205.09992 (2022) - [i40]Oskar Lundström, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Total-order Broadcast. CoRR abs/2209.14685 (2022) - 2021
- [j168]Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal:
On the weakest information on failures to solve mutual exclusion and consensus in asynchronous crash-prone read/write systems. J. Parallel Distributed Comput. 153: 110-118 (2021) - [j167]Michel Raynal:
On the Versatility of Bracha's Byzantine Reliable Broadcast Algorithm. Parallel Process. Lett. 31(3): 2150006:1-2150006:9 (2021) - [j166]Michel Raynal:
Distributed Computability: A Few Results Masters Students Should Know. SIGACT News 52(2): 92-110 (2021) - [j165]Alex Auvolat, Davide Frey, Michel Raynal, François Taïani:
Byzantine-tolerant causal broadcast. Theor. Comput. Sci. 885: 55-68 (2021) - [j164]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) - [c340]Michel Raynal, Jiannong Cao:
From Incomplete to Complete Networks in Asynchronous Byzantine Systems. AINA (1) 2021: 102-112 - [c339]Oskar Lundström, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems. EDCC 2021: 111-118 - [c338]Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, Nicolas Nicolaou, Michel Raynal, Antonio Russo:
Byzantine-Tolerant Distributed Grow-Only Sets: Specification and Applications. FAB 2021: 2:1-2:19 - [c337]Oskar Lundström, Michel Raynal, Elad Michael Schiller:
Self-Stabilizing Indulgent Zero-degrading Binary Consensus. ICDCN 2021: 106-115 - [c336]Chryssis Georgiou, Ioannis Marcoullis, Michel Raynal, Elad Michael Schiller:
Loosely-self-stabilizing Byzantine-Tolerant Binary Consensus for Signature-Free Message-Passing Systems. NETYS 2021: 36-53 - [c335]Carlos López, Sergio Rajsbaum, Michel Raynal, Karla Vargas:
Leader Election in Arbitrarily Connected Networks with Process Crashes and Weak Channel Reliability. NETYS 2021: 54-70 - [c334]Davide Frey, Lucie Guillou, Michel Raynal, François Taïani:
Consensus-Free Ledgers When Operations of Distinct Processes are Commutative. PaCT 2021: 359-370 - [c333]Timothé Albouy, Davide Frey, Michel Raynal, François Taïani:
Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn. SSS 2021: 21-33 - [i39]Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, Nicolas Nicolaou, Michel Raynal, Antonio Russo:
Byzantine-tolerant Distributed Grow-only Sets: Specification and Applications. CoRR abs/2103.08936 (2021) - [i38]Chryssis Georgiou, Ioannis Marcoullis, Michel Raynal, Elad Michael Schiller:
Loosely-self-stabilizing Byzantine-tolerant Binary Consensus for Signature-free Message-passing Systems. CoRR abs/2103.14649 (2021) - [i37]Oskar Lundström, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems. CoRR abs/2104.03129 (2021) - [i36]Carlos López, Sergio Rajsbaum, Michel Raynal, Karla Vargas:
Leader Election in Arbitrarily Connected Networks with Process Crashes and Weak Channel Reliability. CoRR abs/2105.02972 (2021) - [i35]Romaric Duvignau, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Byzantine- and Intrusion-tolerant Consensus. CoRR abs/2110.08592 (2021) - 2020
- [j163]Sergio Rajsbaum, Michel Raynal:
Mastering concurrent computing through sequential thinking. Commun. ACM 63(1): 78-87 (2020) - [j162]Alex Auvolat, Davide Frey, Michel Raynal, François Taïani:
Money Transfer Made Simple: a Specification, a Generic Algorithm, and its Proof. Bull. EATCS 132 (2020) - [j161]Michel Raynal, Gadi Taubenfeld:
Mutual exclusion in fully anonymous shared memory systems. Inf. Process. Lett. 158: 105938 (2020) - [j160]Karla Vargas, Sergio Rajsbaum, Michel Raynal:
An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values. Parallel Process. Lett. 30(2): 2050006:1-2050006:23 (2020) - [j159]Sergio Rajsbaum, Michel Raynal:
60 Years of Mastering Concurrent Computing through Sequential Thinking. SIGACT News 51(2): 59-88 (2020) - [j158]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) - [j157]Weiping Zhu, Xing Meng, Xiaolei Peng, Jiannong Cao, Michel Raynal:
Collisions Are Preferred: RFID-Based Stocktaking with a High Missing Rate. IEEE Trans. Mob. Comput. 19(7): 1544-1554 (2020) - [c332]Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, Nicolas Nicolaou, Michel Raynal:
Atomic Appends in Asynchronous Byzantine Distributed Ledgers. EDCC 2020: 77-84 - [c331]Oskar Lundström, Michel Raynal, Elad Michael Schiller:
Self-Stabilizing Set-Constrained Delivery Broadcast (extended abstract). ICDCS 2020: 617-627 - [c330]Oskar Lundström, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Uniform Reliable Broadcast. NETYS 2020: 296-313 - [c329]Michel Raynal, Gadi Taubenfeld:
Fully Anonymous Consensus and Set Agreement Algorithms. NETYS 2020: 314-328 - [c328]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
Relaxed Queues and Stacks from Read/Write Operations. OPODIS 2020: 13:1-13:19 - [c327]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. PODC 2020: 41-50 - [c326]Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal:
k-Immediate Snapshot and x-Set Agreement: How Are They Related? SSS 2020: 97-112 - [c325]Sergio Rajsbaum, Michel Raynal, Karla Vargas:
Brief Announcement: Leader Election in the ADD Communication Model. SSS 2020: 229-234 - [i34]Oskar Lundström, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Uniform Reliable Broadcast. CoRR abs/2001.03244 (2020) - [i33]Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, Nicolas C. Nicolaou, Michel Raynal:
Appending Atomically in Byzantine Distributed Ledgers. CoRR abs/2002.11593 (2020) - [i32]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
What Can Be Done with Consensus Number One: Relaxed Queues and Stacks. CoRR abs/2005.05427 (2020) - [i31]Alex Auvolat, Davide Frey, Michel Raynal, François Taïani:
Money Transfer Made Simple. CoRR abs/2006.12276 (2020) - [i30]Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal:
t-Resilient k-Immediate Snapshot and its Relation with Agreement Problems. CoRR abs/2010.00096 (2020) - [i29]Oskar Lundström, Michel Raynal, Elad Michael Schiller:
Self-Stabilizing Indulgent Zero-degrading Binary Consensus. CoRR abs/2010.05489 (2020)
2010 – 2019
- 2019
- [j156]Achour Mostéfaoui, Michel Raynal, Matthieu Roy:
Time-efficient read/write register in crash-prone asynchronous message-passing systems. Computing 101(1): 3-17 (2019) - [j155]Tyler Crain, Vincent Gramoli, Michel Raynal:
A speculation-friendly binary search tree. Concurr. Comput. Pract. Exp. 31(4) (2019) - [j154]Michel Raynal:
An Informal Visit to the Wonderful Land of Consensus Numbers and Beyond. Bull. EATCS 129 (2019) - [j153]Achour Mostéfaoui, Matthieu Perrin, Michel Raynal, Jiannong Cao:
Crash-tolerant causal broadcast in O(n) messages. Inf. Process. Lett. 151 (2019) - [j152]Armando Castañeda, Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal:
Making Local Algorithms Wait-Free: the Case of Ring Coloring. Theory Comput. Syst. 63(2): 344-365 (2019) - [j151]Hicham Lakhlef, Michel Raynal, François Taïani:
Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks. IEEE Trans. Parallel Distributed Syst. 30(7): 1672-1686 (2019) - [c324]Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal:
On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion. AINA 2019: 272-285 - [c323]Michel Raynal, Jiannong Cao:
One for All and All for One: Scalable Consensus in a Hybrid Communication Model. ICDCS 2019: 464-471 - [c322]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Mutex-Based De-anonymization of an Anonymous Read/Write Memory. NETYS 2019: 311-326 - [c321]Alex Auvolat, Michel Raynal, François Taïani:
Byzantine-Tolerant Set-Constrained Delivery Broadcast. OPODIS 2019: 6:1-6:23 - [c320]Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal:
Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure Detector. PaCT 2019: 419-430 - [c319]Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel:
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. PODC 2019: 157-166 - [c318]Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
A New Insight into Local Coin-Based Randomized Consensus. PRDC 2019: 207-216 - [c317]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Anonymous Read/Write Memory: Leader Election and De-anonymization. SIROCCO 2019: 246-261 - [c316]Michel Raynal:
The Notion of Universality in Crash-Prone Asynchronous Message-Passing Systems: A Tutorial. SRDS 2019: 334-350 - [c315]Michel Raynal, Gadi Taubenfeld:
Brief Announcement: Fully Anonymous Shared Memory Algorithms. SSS 2019: 301-306 - [i28]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Mutex-based Desanonymization of an Anonymous Read/Write Memory. CoRR abs/1903.12204 (2019) - [i27]Michel Raynal, Gadi Taubenfeld:
Fully Anonymous Shared Memory Algorithms. CoRR abs/1909.05576 (2019) - 2018
- [b7]Michel Raynal:
Fault-Tolerant Message-Passing Distributed Systems - An Algorithmic Approach. Springer 2018, ISBN 978-3-319-94140-0, pp. 1-459 - [j150]Hicham Lakhlef, Abdelmadjid Bouabdallah, Michel Raynal, Julien Bourgeois:
Agent-based broadcast protocols for wireless heterogeneous node networks. Comput. Commun. 115: 51-63 (2018) - [j149]Zohir Bouzid, Michel Raynal, Pierre Sutra:
Anonymous obstruction-free (n, k)-set agreement with n-k+1 atomic read/write registers. Distributed Comput. 31(2): 99-117 (2018) - [j148]Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Extending Causal Consistency to any Object Defined by a Sequential Specification. Bull. EATCS 125 (2018) - [j147]Weiping Zhu, Jiannong Cao, Michel Raynal:
Energy-Efficient Composite Event Detection in Wireless Sensor Networks. IEEE Commun. Lett. 22(1): 177-180 (2018) - [j146]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability. J. ACM 65(6): 45:1-45:42 (2018) - [j145]Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
A Simple Object that Spans the Whole Consensus Hierarchy. Parallel Process. Lett. 28(2): 1850006:1-1850006:9 (2018) - [j144]Achour Mostéfaoui, Hamouma Moumen, Michel Raynal:
Randomized k-set agreement in crash-prone and Byzantine asynchronous systems. Theor. Comput. Sci. 709: 80-97 (2018) - [j143]Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal:
Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems. IEEE Trans. Parallel Distributed Syst. 29(9): 2033-2045 (2018) - [c314]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 - [c313]Weiping Zhu, Xing Meng, Xiaolei Peng, Jiannong Cao, Michel Raynal:
Time-Efficient RFID-Based Stocktaking with a Coarse-Grained Inventory List. IWQoS 2018: 1-6 - [c312]Michel Raynal, Jiannong Cao:
A Pleasant Stroll Through the Land of Distributed Machines, Computation, and Universality. MCU 2018: 34-50 - [c311]Tyler Crain, Vincent Gramoli, Mikel Larrea, Michel Raynal:
DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains. NCA 2018: 1-8 - [c310]Michel Raynal, Jiannong Cao:
Anonymity in Distributed Read/Write Systems: An Introductory Survey. NETYS 2018: 122-140 - [c309]Amitay Shaer, Shlomi Dolev, Silvia Bonomi, Michel Raynal, Roberto Baldoni:
Bee's Strategy Against Byzantines Replacing Byzantine Participants - (Extended Abstract). SSS 2018: 139-153 - [c308]Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Set Agreement and Renaming in the Presence of Contention-Related Crash Failures. SSS 2018: 269-283 - [i26]Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
A Simple Object that Spans the Whole Consensus Hierarchy. CoRR abs/1802.00678 (2018) - [i25]Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Extending Causal Consistency to any Object Defined by a Sequential Specification. CoRR abs/1802.00706 (2018) - [i24]Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel:
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. CoRR abs/1810.03723 (2018) - [i23]Sergio Rajsbaum, Michel Raynal:
Mastering Concurrent Computing Through Sequential Thinking: A Half-century Evolution. CoRR abs/1812.06011 (2018) - 2017
- [j142]Achour Mostéfaoui, Michel Raynal:
Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t< n/3, O(n2) messages, and constant time. Acta Informatica 54(5): 501-520 (2017) - [j141]Michel Raynal:
Distributed Universal Constructions: a Guided Tour. Bull. EATCS 121 (2017) - [j140]Christian Fernández-Campusano, Mikel Larrea, Roberto Cortiñas, Michel Raynal:
A distributed leader election algorithm in crash-recovery and omissive systems. Inf. Process. Lett. 118: 100-104 (2017) - [j139]Achour Mostéfaoui, Matoula Petrolia, Michel Raynal, Claude Jard:
Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems. Theory Comput. Syst. 60(4): 677-694 (2017) - [j138]Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer:
From wait-free to arbitrary concurrent solo executions in colorless distributed computing. Theor. Comput. Sci. 683: 1-21 (2017) - [c307]Abdelmadjid Bouabdallah, Hicham Lakhlef, Michel Raynal, François Taïani:
Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks. AINA 2017: 399-406 - [c306]Armando Castañeda, Yoram Moses, Michel Raynal, Matthieu Roy:
Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour. NETYS 2017: 206-221 - [c305]Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
Long-Lived Tasks. NETYS 2017: 439-454 - [c304]Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Which Broadcast Abstraction Captures k-Set Agreement?. DISC 2017: 27:1-27:16 - [i22]Tyler Crain, Vincent Gramoli, Mikel Larrea, Michel Raynal:
(Leader/Randomization/Signature)-free Byzantine Consensus for Consortium Blockchains. CoRR abs/1702.03068 (2017) - [i21]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) - [i20]Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Which Broadcast Abstraction Captures $k$-Set Agreement? CoRR abs/1705.04835 (2017) - [i19]Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. CoRR abs/1706.05267 (2017) - 2016
- [j137]Michel Raynal, Julien Stainer, Gadi Taubenfeld:
Distributed Universality. Algorithmica 76(2): 502-535 (2016) - [j136]Guevara Noubir, Michel Raynal:
Special issue on NETYS'14 selected papers. Computing 98(8): 775 (2016) - [j135]Zohir Bouzid, Damien Imbs, Michel Raynal:
A necessary condition for Byzantine k-set agreement. Inf. Process. Lett. 116(12): 757-759 (2016) - [j134]Roberto Baldoni, Silvia Bonomi, Michel Raynal:
Implementing set objects in dynamic distributed systems. J. Comput. Syst. Sci. 82(5): 654-689 (2016) - [j133]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) - [j132]Tyler Crain, Vincent Gramoli, Michel Raynal:
A Fast Contention-Friendly Binary Search Tree. Parallel Process. Lett. 26(3): 1650015:1-1650015:17 (2016) - [j131]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) - [j130]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) - [j129]