Michel Raynal

Q: What Schools Are Affiliated With Michel Raynal

Michel Raynal is affiliated with the following schools: University of Bordeaux, Rennes 2 University

Michel Raynal's AcademicInfluence.com Rankings

Michel Raynal

Computer Science

#2543

World Rank

#2656

Historical Rank

Database

#1767

World Rank

#1852

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Michel Raynal's Degrees

PhD Computer Science Rennes 2 University

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Michel Raynal Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Michel Raynal is a French informatics scientist, professor at IRISA, University of Rennes, France. He is known for his contributions in the fields of algorithms, computability, and fault-tolerance in the context of concurrent and distributed systems. Michel Raynal is also Distinguished Chair professor at the Hong Kong Polytechnic University and editor of the “Synthesis Lectures on Distributed Computing Theory” published by Morgan & Claypool. He is a senior member of Institut Universitaire de France and a member of Academia Europaea.

(See a Problem?)

Michel Raynal's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Algorithms for mutual exclusion (1986) (382)
The Causal Ordering Abstraction and a Simple Way to Implement it (1991) (257)
Logical Time: Capturing Causality in Distributed Systems (1996) (248)
Concurrent Programming: Algorithms, Principles, and Foundations (2012) (170)
Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach (1999) (170)
Distributed Algorithms for Message-Passing Systems (2013) (160)
Conditions on input vectors for consensus solvability in asynchronous distributed systems (2001) (138)
Distributed algorithms and protocols (1988) (135)
Asynchronous implementation of failure detectors (2003) (132)
An adaptive failure detection protocol (2001) (128)
The information structure of indulgent consensus (2004) (127)
From group communication to transactions in distributed systems (1996) (125)
A simple taxonomy for distributed mutual exclusion algorithms (1991) (123)
Leader-Based Consensus (2001) (119)
DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains (2018) (117)
A communication-induced checkpointing protocol that ensures rollback-dependency trackability (1997) (116)
Timed consistency for shared distributed objects (1999) (105)
Signature-free asynchronous byzantine consensus with t < n/3 and o(n2) messages (2014) (102)
An Adaptive Causal Ordering Algorithm Suited to Mobile Computing Environments (1997) (100)
A simple and fast asynchronous consensus protocol based on a weak failure detector (1999) (98)
Consensus in One Communication Step (2001) (96)
Fault-Tolerant Message-Passing Distributed Systems (2018) (96)
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems (2010) (96)
Communication-based prevention of useless checkpoints in distributed computations (2000) (94)
Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time (2015) (86)
Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems (2004) (84)
An efficient causal ordering algorithm for mobile computing environments (1996) (79)
Preventing useless checkpoints in distributed computations (1997) (78)
Communication-induced determination of consistent snapshots (1998) (78)
Consensus in synchronous systems: a concise guided tour (2002) (77)
Synchronization and control of distributed systems and programs (1990) (76)
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour (1999) (75)
Atomic broadcast in asynchronous crash-recovery distributed systems (2000) (74)
Consensus in asynchronous systems where processes can crash and recover (1998) (74)
A speculation‐friendly binary search tree (2012) (74)
From static distributed systems to dynamic systems (2005) (73)
A Distributed Solution to the k-out of-M Resources Allocation Problem (1991) (70)
A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors (2002) (70)
Fundamentals of Distributed Computing: A Practical Tour of Vector Clock Systems (2002) (68)
Deadlock Models and a General Algorithm for Distributed Deadlock Detection (1996) (67)
From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems (2000) (66)
Efficient Distributed Detection of Conjunctions of Local Predicates (1998) (66)
A general framework to solve agreement problems (1999) (65)
The renaming problem in shared memory systems: An introduction (2011) (65)
Detecting atomic sequences of predicates in distributed computations (1993) (63)
From Causal Consistency to Sequential Consistency in Shared Memory Systems (1995) (61)
Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks (2007) (60)
The Alpha of Indulgent Consensus (2007) (60)
Fault-tolerant Total Order Multicast to asynchronous groups (1998) (59)
A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network (1988) (59)
About logical clocks for distributed systems (1992) (59)
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors (2000) (58)
Anonymous publish/subscribe in P2P networks (2003) (57)
A Contention-Friendly Binary Search Tree (2013) (57)
k-set agreement with limited accuracy failure detectors (2000) (56)
A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms (1994) (55)
Implementing a Register in a Dynamic Distributed System (2009) (55)
Detection of stable properties in distributed applications (1987) (54)
An introduction to snapshot algorithms in distributed computing (1995) (54)
A Suite of Formal Definitions for Consistency Criteria in Distributed Shared Memories (1996) (54)
k-Arbiter: A Safe and General Scheme for h-out of-k Mutual Exclusion (1998) (53)
An adaptive protocol for implementing causally consistent distributed services (1998) (53)
Consistency Issues in Distributed Checkpoints (1999) (53)
On the Fly Testing of Regular Patterns in Distributed Computations (1994) (53)
Looking for a Definition of Dynamic Distributed Systems (2007) (51)
(Leader/Randomization/Signature)-free Byzantine Consensus for Consortium Blockchains (2017) (50)
Anonymous asynchronous systems: the case of failure detectors (2010) (50)
From serializable to causal transactions for collaborative applications (1997) (48)
Consensus in Byzantine asynchronous systems (2003) (45)
No Hot Spot Non-blocking Skip List (2013) (45)
Randomized multivalued consensus (2001) (45)
Crash-resilient time-free eventual leadership (2004) (44)
In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement (2006) (44)
Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations) (2012) (44)
An Adaptive Programming Model for Fault-Tolerant Distributed Computing (2007) (42)
Causal multicasts in overlapping groups: towards a low cost approach (1993) (42)
Efficient Δ-causal broadcasting (1998) (42)
Optimal early stopping uniform consensus in synchronous systems with process omission failures (2004) (42)
Help when needed, but no more: Efficient read/write partial snapshot (2009) (42)
A unified framework for the specification and run-time detection of dynamic properties in distributed computations (1996) (40)
The best of both worlds: A hybrid approach to solve consensus (2000) (40)
Power and limits of distributed computing shared memory models (2013) (39)
The k-simultaneous consensus problem (2010) (39)
Networks and distributed computation: concepts, tools, and algorithms (1988) (38)
From crash fault-tolerance to arbitrary-fault tolerance: towards a modular approach (2000) (38)
Group membership failure detection: a simple protocol and its probabilistic analysis (1999) (38)
A necessary and sufficient condition for transforming limited accuracy failure detectors (2004) (38)
Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors (2013) (38)
Asynchronous Agreement and Its Relation with Error-Correcting Codes (2007) (38)
Deadline-constrained causal order (2000) (37)
Rollback-Dependency Trackability: A Minimal Characterization and Its Protocol (2001) (37)
Virtual Precedence in Asynchronous Systems: Cencept and Applications (1997) (37)
Brief announcement: virtual world consistency: a new condition for STM systems (2009) (36)
The Iterated Restricted Immediate Snapshot Model (2008) (35)
Efficient causally ordered communications for multimedia real-time applications (1995) (35)
Sequential Consistency in Distributed Systems (1994) (35)
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony (2006) (34)
Fault-Tolerant Leader Election in Mobile Dynamic Distributed Systems (2013) (34)
Time-free and timer-based assumptions can be combined to obtain eventual leadership (2006) (33)
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols (2004) (32)
Anonymous Obstruction-free (n, k)-Set Agreement with n-k+1 Atomic Read/Write Registers (2015) (32)
Specification and Verification of Dynamic Properties in Distributed Computations (1995) (31)
Anonymous graph exploration without collision by mobile robots (2008) (31)
From adaptive renaming to set agreement (2009) (31)
Evaluating the condition-based approach to solve consensus (2003) (31)
Sequential consistency as lazy linearizability (2002) (30)
On classes of problems in asynchronous distributed systems with process crashes (1999) (30)
A hybrid approach for building eventually accurate failure detectors (2004) (30)
Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots (2008) (30)
Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability (2007) (29)
Normality: A Consistency Condition for Concurrent Objects (1999) (29)
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement (2008) (29)
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity (2011) (28)
Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract) (2015) (28)
Unifying Concurrent Objects and Distributed Tasks (2018) (27)
Condition-Based Protocols for Set Agreement Problems (2002) (27)
On asymmetric progress conditions (2010) (27)
Distributed Agreement and Its Relation with Error-Correcting Codes (2002) (26)
Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n2) Messages, and Constant Time (2015) (26)
Eventual Clusterer: A Modular Approach to Designing Hierarchical Consensus Protocols in MANETs (2009) (26)
Low cost consensus-based Atomic Broadcast (2000) (26)
The universe of symmetry breaking tasks (2011) (26)
On the computability power and the robustness of set agreement-oriented failure detector classes (2008) (26)
Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus) (2011) (25)
Distributed Computing with Mobile Robots: An Introductory Survey (2011) (25)
A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness (2008) (25)
Two Abstractions for Implementing Atomic Objects in Dynamic Systems (2005) (25)
Exploring Gafni's Reduction Land: From Omegak to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement (2006) (25)
Exploiting write semantics in implementing partially replicated causal objects (1998) (25)
A versatile and modular consensus protocol (2002) (25)
Randomized k-set agreement (2001) (25)
On-The-Fly Analysis of Distributed Computations (1995) (25)
A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems (2007) (24)
Early stopping in global data computation (2002) (24)
A Time-free Assumption to Implement Eventual Leadership (2006) (24)
Consensus-Based Fault-Tolerant Total Order Multicast (2001) (24)
A case study of agreement problems in distributed systems: non-blocking atomic commitment (1997) (24)
DBFT: Efficient Byzantine Consensus with a Weak Coordinator and its Application to Consortium Blockchains (2017) (23)
Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast (2015) (23)
Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes (2016) (23)
Parallel and distributed algorithms (1989) (23)
Small-World Networks: From Theoretical Bounds to Practical Systems (2007) (23)
The multiplicative power of consensus numbers (2010) (23)
Towards a universal construction for transaction-based multiprocess programs (2012) (23)
Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus (2006) (23)
Networks and Distributed Computation (1988) (23)
Debugging tool for distributed Estelle programs (1993) (22)
Causal delivery of messages with real-time data in unreliable networks (1996) (22)
A Simple Broadcast Algorithm for Recurrent Dynamic Systems (2014) (21)
An introduction to oracles for asynchronous distributed systems (2002) (21)
On the road to the weakest failure detector for k-set agreement in message-passing systems (2011) (21)
Rollback-dependency trackability: visible characterizations (1999) (21)
Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus (1999) (21)
Inevitable global states: a concept to detect unstable properties of distributed computations in an observer independent way (1994) (21)
Specifying and Implementing an Eventual Leader Service for Dynamic Systems (2011) (20)
Lifetime Based Consistency Protocols for Distributed Objects (1998) (20)
Sequential Consistency in Distributed Systems : Theory and Implementation (1995) (20)
General and Efficient Decentralized Consensus Protocols (1987) (20)
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation (2009) (20)
Consistent Checkpointing in Message Passing Distributed Systems (1995) (20)
A hierarchy of conditions for consensus solvability (2001) (20)
Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn (2012) (20)
Using Conditions to Expedite Consensus in Synchronous Distributed Systems (2003) (19)
Logical Time: A Way to Capture Causality in Distributed Systems (1995) (19)
A Dual-Token-Based Fault Tolerant Mutual Exclusion Algorithm for MANETs (2007) (19)
Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems (2016) (19)
Synchronous condition-based consensus (2006) (19)
Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value (2010) (19)
Broadcast with time and causality constraints for multimedia applications (1996) (19)
A simple proof of the necessity of the failure detector Sigma to implement an atomic register in asynchronous message-passing systems (2010) (19)
An impossibility about failure detectors in the iterated immediate snapshot model (2008) (19)
On Modeling Consistent Checkpoints and the Domino Effect in Distributed Systems (1995) (19)
Specification and Verification of Behavioral Patterns in Distributed Computations (1995) (19)
From an Asynchronous Intermittent Rotating Star to an Eventual Leader (2010) (18)
Regular Register: An Implementation in a Churn Prone Environment (2009) (18)
Shared state consistency for time-sensitive distributed applications (2001) (18)
The Committee Decision Problem (2006) (18)
A generic framework for indulgent consensus (2003) (18)
Looking for the Weakest Failure Detector for k -Set Agreement in Message-passing Systems: Is (cid:5) _ k the End of the Road? (18)
On-the-fly replay: a practical paradigm and its implementation for distributed debugging (1994) (18)
Computing in the Presence of Concurrent Solo Executions (2014) (17)
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion (2018) (17)
A general method to define quorums (1992) (17)
A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition (2009) (17)
Time, clocks and temporal order (1999) (17)
Distributed Slicing in Dynamic Systems (2006) (17)
Distributed Universality (2016) (17)
A weakest failure detector-based asynchronous consensus protocol for f (2004) (16)
Irreducibility and additivity of set agreement-oriented failure detector classes (2006) (16)
Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems) (2006) (16)
Brief announcement: increasing the power of the iterated immediate snapshot model with failure detectors (2012) (16)
From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation (2007) (16)
A distributed implementation of sequential consistency with multi-object operations (2004) (16)
A Distributed Algorithm to Prevent Mutual Drift Between n Logical Clocks (1987) (16)
Time in Distributed System Models and Algorithms (1999) (16)
Anonymous obstruction-free (n, k)-set agreement with $$n-k+1$$n-k+1 atomic read/write registers (2015) (16)
Looking for the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems: Is ${\it \Pi}_k${\it \Pi}_k the End of the Road? (2009) (16)
Money Transfer Made Simple: a Specification, a Generic Algorithm, and its Proof (2020) (16)
From wait-free to arbitrary concurrent solo executions in colorless distributed computing (2017) (15)
Asynchronous bounded lifetime failure detectors (2005) (15)
A liveness condition for concurrent objects: x‐wait‐freedom (2011) (15)
Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems (2011) (15)
Efficient Condition-Based Consensus (2001) (15)
Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks (2012) (14)
Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $$t (2017) (14)
The combined power of conditions and failure detectors to solve asynchronous set agreement (2005) (14)
Efficient Causality-Tracking Timestamping (2003) (14)
A leader election protocol for eventually synchronous shared memory systems (2006) (14)
Simple and Efficient Reliable Broadcast in the Presence of Byzantine Processes (2015) (14)
Synchronization and concurrency measures for distributed computations (1992) (14)
Consistent records in asynchronous computations (1998) (14)
Revisiting simultaneous consensus with crash failures (2009) (14)
Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime (2006) (14)
Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects (2016) (14)
Characterization of consistent global checkpoints in large-scale distributed systems (1995) (14)
A suite of definitions for consistency criteria in distributed shared memories (1997) (14)
Computing global functions in asynchronous distributed systems prone to process crashes (2000) (14)
Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems (2016) (14)
Efficient Message Logging for Uncoordinated Checkpointing Protocols (1996) (14)
A hierarchical consensus protocol for mobile ad hoc networks (2006) (13)
Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems: Extended abstract (2015) (13)
Structured Specification of Communicating Systems (1983) (13)
Timed Quorum Systems for Large-Scale and Dynamic Environments (2007) (13)
Minimal Synchrony for Byzantine Consensus (2015) (13)
On the Consistency Conditions of Transactional Memories (2008) (13)
Interval Consistency of Asynchronous Distributed Computations (2002) (13)
Byzantine-tolerant causal broadcast (2021) (13)
Mastering Agreement Problems in Distributed Systems (2001) (13)
From serializable to causal transactions (abstract) (1996) (13)
From an intermittent rotating star to a leader (2007) (13)
Prime Numbers as a Tool to Design Distributed Algorithms (1989) (13)
Consensus based on failure detectors with a perpetual accuracy property (2000) (12)
Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures (2006) (12)
Distributed Universal Constructions: a Guided Tour (2017) (12)
A note on a simple equivalence between round-based synchronous and asynchronous models (2005) (12)
Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results (2013) (12)
Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems (2016) (12)
Read Invisibility, Virtual World Consistency and Probabilistic Permissiveness are Compatible (2011) (12)
D2HT: The Best of Both Worlds, Integrating RPS and DHT (2010) (12)
Probabilistic analysis of a group failure detection protocol (1999) (12)
An introduction to the analysis and debug of distributed computations (1995) (12)
Towards the construction of distributed detection programs, with an application to distributed termination (1994) (12)
ReSIST: Resilience for Survivability in IST (2007) (11)
A Generalized Mutual Exclusion Problem and Its Algorithm (2013) (11)
Token-based sequential consistency in asynchronous distributed systems (2003) (11)
The Mutual Exclusion Problem (2013) (11)
Agent-based broadcast protocols for wireless heterogeneous node networks (2018) (11)
Primary component asynchronous group membership as an instance of a generic agreement framework (2001) (11)
An Implementation of Global Flush Primitives Using Counters (1995) (11)
A distributed leader election algorithm in crash-recovery and omissive systems (2017) (11)
Token-based sequential consistency (2002) (11)
Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early Abort (2009) (11)
Computing particular snapshots in distributed systems (1990) (11)
$\diamondsuit {\mathcal P}_{mute}$-based Consensus for Asynchronous Byzantine Systems (2005) (11)
Energy-Efficient Composite Event Detection in Wireless Sensor Networks (2018) (11)
Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems (2015) (11)
An Introductory Tutorial to Concurrency-Related Distributed Recursion (2013) (11)
Real-time dependable decisions in timed asynchronous distributed systems (1997) (11)
Predicate Detection in Asynchronous Distributed Systems: A Probabilistic Approach (2016) (11)
Direct dependency-based determination of consistent global checkpoints (2001) (11)
Shared Global States in Distributed Computations (1997) (11)
From Unreliable Objects to Reliable Objects: The Case of Atomic Registers and Consensus (2007) (11)
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits (2017) (11)
An adaptive architecture for causally consistent distributed services (1999) (11)
Collisions Are Preferred: RFID-Based Stocktaking with a High Missing Rate (2020) (11)
Local states in distributed computations: a few relations and formulas (1994) (11)
Stabilizing mobile philosophers (2005) (10)
Quorum-Based Multi-Invocation Model for Replicated Objects (2004) (10)
Proceedings of the 9th International Workshop on Distributed Algorithms (1995) (10)
The Synchronous Condition-Based Consensus Hierarchy (2004) (10)
Characterizing and detecting the set of global states seen by all observers of a distributed computation (1995) (10)
Trust-aware peer sampling: Performance and privacy tradeoffs (2013) (10)
Randomized k-set agreement in crash-prone and Byzantine asynchronous systems (2018) (10)
Brief Announcement: A Contention-Friendly, Non-blocking Skip List (2012) (10)
Ordering vs Timeliness: Two Facets of Consistency? (2003) (10)
Time-efficient read/write register in crash-prone asynchronous message-passing systems (2016) (10)
The Eventual Leadership in Dynamic Mobile Networking Environments (2007) (10)
The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses (2002) (10)
Distributed Computing and Networking (2013) (10)
Anonymity in Distributed Read/Write Systems: An Introductory Survey (2018) (10)
Impossibility of Scalar Clock-Based Communication-Induced Checkpointing Protocols Ensuring the Rdt Property (2001) (10)
Restricted failure detectors: Definition and reduction protocols (1999) (10)
t-Resilient Immediate Snapshot Is Impossible (2016) (10)
Self-stabilizing Uniform Reliable Broadcast (2020) (10)
Consensus in Anonymous Distributed Systems: Is There a Weakest Failure Detector? (2010) (10)
Electing an Eventual Leader in an Asynchronous Shared Memory System (2007) (10)
Mutual exclusion in fully anonymous shared memory systems (2020) (9)
Fisheye Consistency: Keeping Data in Synch in a Georeplicated World (2014) (9)
Building responsive TMR-based servers in presence of timing constraints (2002) (9)
EREBUS: a debugger for asynchronous distributed computing systems (1992) (9)
Consensus Based on Strong Failure Detectors: A Time and Message-Efficient Protocol (2000) (9)
Early-Stopping k-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes (2005) (9)
Value-Based Sequential Consistency for Set Objects in Dynamic Distributed Systems (2010) (9)
Coordination and Computation in Distributed Intelligent MEMS (2013) (9)
Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks (2019) (9)
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound (2010) (9)
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity (2009) (8)
Tracking causality in distributed systems: a suite of efficient protocols (2000) (8)
From the Happened-Before Relation to the Causal Ordered Set Abstraction (2012) (8)
A necessary condition for Byzantine k-set agreement (2015) (8)
Fault-Tolerant Distributed Systems: a Modular Approach to the Non-Blocking Atomic Commitment Problem (1996) (8)
Synchronization is Coming Back, But is it the Same? (2008) (8)
Distributed Resource Allocation (2013) (8)
Order notions and atomic multicast in distributed systems: a short survey (1990) (8)
Consistent Checkpointing for Transaction Systems (2001) (8)
Mastering concurrent computing through sequential thinking (2019) (8)
An optimal atomic broadcast protocol and an implementation framework (2003) (8)
Tracking immediate predecessors in distributed computations (2002) (8)
Termination detection in a very general distributed computing model (1993) (8)
A Simple Object that Spans the Whole Consensus Hierarchy (2018) (8)
Are Byzantine Failures Really Different from Crash Failures? (2016) (8)
A hybrid and adaptive model for fault-tolerant distributed computing (2005) (8)
Crash-tolerant causal broadcast in O(n) messages (2019) (8)
Eventual Leader Service in Unreliable Asynchronous Systems: Why? How? (2007) (8)
Distributed termination detection : General model and algorithms (1993) (7)
Static and dynamic adaptation of transactional consistency (1997) (7)
Communication and Agreement Abstractions in the Presence of Byzantine Processes (2014) (7)
Causal Deliveries in Unreliable Networks With Real-Time Delivery Constraints (1994) (7)
Byzantine-Tolerant Set-Constrained Delivery Broadcast (2019) (7)
Synchronous Set Agreement: a Concise Guided Tour (with open problems) (2006) (7)
Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles (2001) (7)
Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour (2017) (7)
Asynchronous protocols to meet real-time constraints: is it really sensible? How to proceed? (1998) (7)
Parallel Computing vs. Distributed Computing: A Great Confusion? (Position Paper) (2015) (7)
Consensus-Based Management of Distributed and Replicated Data (1998) (7)
Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems (2012) (7)
On Modeling Fault Tolerance of Gossip-Based Reliable Multicast Protocols (2008) (7)
What Can be Computed in a Distributed System? (2014) (7)
Large-Scale Networked Systems: From Anarchy to Geometric Self-structuring (2009) (7)
A Contention-Friendly Methodology for Search Structures (2012) (7)
Assigning distinct identities to sites on an anonymous distributed system (1988) (7)
Using asynchrony and zero degradation to speed up indulgent consensus protocols (2008) (7)
Communication efficient distributed shared memories (1992) (7)
Depth-first traversal and virtual ring construction in distributed systems (1987) (7)
Fully Anonymous Consensus and Set Agreement Algorithms (2020) (7)
Implementing set objects in dynamic distributed systems (2016) (7)
Failure Detectors as Schedulers (An Algorithmically-Reasoned Characterization) (2007) (7)
Locks Considered Harmful: A Look at Non-traditional Synchronization (2008) (7)
On Adaptive Renaming under Eventually Limited Contention (2010) (7)
Asynchronous interactive consistency and its relation with error-correcting codes (2002) (7)
Semantics of recovery lines for backward recovery in distributed systems (1995) (6)
Eventual Leader Election Despite Crash-Recovery and Omission Failures (2015) (6)
Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems (2013) (6)
Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks (2017) (6)
An Efficient Implementation of Sequentially Consistent Distributed Shared Memories (1994) (6)
Looking for a common view for mobile worlds (2003) (6)
On the Respective Power of /spl Lozenge/P and /spl Lozenge/S to Solve One-Shot Agreement Problems (2007) (6)
Making Local Algorithms Wait-Free: the Case of Ring Coloring (2016) (6)
The weakest failure detector to implement a register in asynchronous systems with hybrid communication (2011) (6)
A Simple Snapshot Algorithm for Multicore Systems (2011) (6)
Distributed Evaluation: A Tool for Constructing Distributed Detection Programs (1992) (6)
An Optimistic Protocol for a Linearizable Distributed Shared Memory System (1996) (6)
Resilience-Building Technologies: State of Knowledge -- ReSIST NoE Deliverable D12 (2007) (6)
Fair Synchronization in the Presence of Process Crashes and its Weakest Failure Detector (2014) (6)
Elastic vector time (2003) (6)
FAST ASYNCHRONOUS CONSENSUS BASED ON A WEAK FAILURE DETECTOR (1997) (6)
A Methodological Construction of an Efficient Sequentially Consistent Distributed Shared Memory (2010) (6)
Mastering Concurrent Computing Through Sequential Thinking: A Half-century Evolution (2018) (6)
A Necessary and Sufficient Synchrony Condition for Solving Byzantine Consensus in Symmetric Networks (2011) (6)
About state recording in asynchronous computations (1996) (6)
Types in a mixed language system (1981) (6)
Illustrating the Use of Vector Clocks in Property Detection: An Example and a Counter-Example (1999) (6)
From Renaming to Set Agreement (2007) (5)
Self-Stabilizing Indulgent Zero-degrading Binary Consensus (2020) (5)
Uniform agreement despite process omission failures (2003) (5)
Long-Lived Tasks (2017) (5)
Shared Memory Synchronization in Presence of Failures: An Exercise-Based Introduction for the Sophomore (2009) (5)
On the Fly Estimation of the Processes that Are Alive in an Asynchronous Message-Passing System (2009) (5)
Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model (2010) (5)
A consensus protocol based on a weak failure detector and a sliding round window (2001) (5)
From a Store-Collect Object and Ω to Efficient Asynchronous Consensus (2012) (5)
A Lock-based Protocol for Software Transactional Memory (2008) (5)
A Theory-Oriented Introduction to Wait-Free Synchronization Based on the Adaptive Renaming Problem (2011) (5)
Anonymous Read/Write Memory: Leader Election and De-anonymization (2019) (5)
Timed Quorum System for Large-Scale Dynamic Environments (2007) (5)
The notion of a timed register and its application to indulgent synchronization (2007) (5)
Failure detectors are schedulers (2007) (5)
Software Transactional Memories: An Approach for Multicore Programming (2009) (5)
No double discount: Condition-based simultaneity yields limited gain (2008) (5)
A practical building block for solving agreement problems in asynchronous distributed systems (1998) (5)
The x-Wait-Freedom Progress Condition (2010) (5)
Expressing and detecting control flow properties of distributed computations (1995) (5)
Joining a Distributed Shared Memory Computation in a Dynamic Distributed System (2009) (5)
On the Implementation of Concurrent Objects (2011) (5)
Decision optimal early-stopping k-set agreement in synchronous systems prone to send omission failures (2005) (5)
A Fast Contention-Friendly Binary Search Tree (2016) (5)
Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems (2021) (5)
Round-based Synchrony Weakened by Message Adversaries vs Asynchrony Enriched with Failure Detectors (2013) (5)
Elements for a course on the design of distributed algorithms (1992) (5)
Conditions for Set Agreement with an Application to Synchronous Systems (2008) (5)
Reliable Shared Memory Abstractions on Top of Asynchronous t-Resilient Byzantine Message-passing Systems (2014) (5)
Optimal Collision/Conflict-Free Distance-2 Coloring in Wireless Synchronous Broadcast/Receive Tree Networks (2016) (4)
Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks (2013) (4)
A Note on the Determination of the Immediate Predecessors in a Distributed Computation (2002) (4)
From Incomplete to Complete Networks in Asynchronous Byzantine Systems (2021) (4)
Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems (2014) (4)
A Hierarchy of Conditions for Asynchronous Interactive Consistency (2003) (4)
Specifying Concurrent Problems: Beyond Linearizability (2015) (4)
Brief announcement: abstractions for implementing atomic objects in dynamic systems (2005) (4)
A note on atomicity: Boosting Test&Set to solve consensus (2009) (4)
Narrowing Power vs. Efficiency in Synchronous Set Agreement (2008) (4)
E cient-Causal Broadcasting (1998) (4)
One for All and All for One: Scalable Consensus in a Hybrid Communication Model (2019) (4)
On-the-fly detection of conjunctions of local predicates in distributed computations (1996) (4)
Leader-based de-anonymization of an anonymous read/write memory (2020) (4)
Computability in distributed computing: a Tutorial (2012) (4)
A Simple Asynchronous Shared Memory Consensus Algorithm Based on Omega and Closing Sets (2012) (4)
Debugging Distributed Executions by Using Language Recognition (1995) (4)
Adaptive checkpointing in message passing distributed systems (1997) (4)
Small-World Networks: Is there a mismatch between theory and practice? (2007) (4)
A Graph-Based Characterization of Communications Modes In Distributed Executions (1995) (4)
Atomic Appends in Asynchronous Byzantine Distributed Ledgers (2020) (4)
Optimal Collision/Conflict-free Distance-2 Coloring in Synchronous Broadcast/Receive Tree Networks (2016) (4)
Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible (2010) (4)
Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn (2021) (4)
Set Agreement and Renaming in the Presence of Contention-Related Crash Failures (2018) (3)
Modularity: a first class concept to address distributed systems (2008) (3)
Wait-free objects for real-time systems? (2002) (3)
The Renaming Problem as an Introduction to Structures for Wait-Free Computing (2003) (3)
Using Error-Correcting Codes to Solve Distributed Agreement Problems: A Future Direction in Distributed Computing? (2003) (3)
Brief announcement: early decision despite general process omission failures (2003) (3)
Nested invocation protocol for object-based systems (2003) (3)
A methodological construction of an efficient sequential consistency protocol (2004) (3)
Special Issue on Distributed Computing and Networking (2015) (3)
Definition and Implementation of a Flexible Communication Primitive for Distributed Programming (1994) (3)
The Notion of Universality in Crash-Prone Asynchronous Message-Passing Systems: A Tutorial (2019) (3)
Set Agreement (2008) (3)
Approximate real-time clocks for scheduled events (2002) (3)
Revisiting the Non-Blocking Atomic Commitment Problem in Distributed Systems (2000) (3)
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems (2020) (3)
Vertex Coloring with Communication and Local Memory Constraints in Synchronous Broadcast Networks (2016) (3)
Which Broadcast Abstraction Captures k-Set Agreement? (2017) (3)
Simple Deadlock Detection for the And-Communication Model (2014) (3)
On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion (2019) (3)
Distributed Termination Detection (2013) (3)
Deadlocks in distributed systems: request models and definitions (1995) (3)
Mutex-based Desanonymization of an Anonymous Read/Write Memory (2019) (3)
Byzantine-tolerant Distributed Grow-only Sets: Specification and Applications (2021) (3)
A Contention-Friendly, Non-Blocking Skip List (2012) (3)
Modular randomized byzantine k-set agreement in asynchronous message-passing systems (2016) (3)
Intersecting sets: a basic abstraction for asynchronous agreement problems (2005) (3)
Logically Instantaneous Communication on Top of Distributed Memory Parallel Machines (1999) (3)
A communication-efficient leader election algorithm in partially synchronous systems prone to crash-recovery and omission failures (2016) (3)
Consensus-Free Ledgers When Operations of Distinct Processes are Commutative (2021) (3)
A Few Definitions and Two Introductory Examples (2018) (3)
Atomic Broadcast and Quorum-based Replication in Asynchronous Crash-Recovery Distributed Systems (1999) (3)
Building and Using Quorums Despite any Number of Process of Crashes (2005) (3)
Distributed Universality: Contention-Awareness, Wait-freedom, Object Progress, and Other Properties (2014) (3)
The Notion of Veto Number for Distributed Agreement Problems (2004) (3)
Leader Election: From Higham-Przytycka's Algorithm to a Gracefully Degrading Algorithm (2012) (3)
Concurrent Systems: Hybrid Object Implementations and Abortable Objects (2015) (3)
Self-Stabilizing Set-Constrained Delivery Broadcast (extended abstract) (2020) (3)
Reliable Compare&Swap for fault-tolerant synchronization (2003) (3)
Basic Definitions and Network Traversal Algorithms (2013) (3)
Wait-free computing: an introductory lecture (2005) (3)
Mixed Consistency Model: Meeting Data Sharing Needs of Heterogeneous Users (2005) (3)
A Look at Basics of Distributed Computing (2016) (3)
Distributed Database Checkpointing (1999) (3)
Efficient Broadcast Protocol for the Internet of Things (2016) (3)
A Pleasant Stroll Through the Land of Distributed Machines, Computation, and Universality (2018) (2)
The Notion of Veto Number and the Respective Power of OP and OS to Solve One-Shot Agreement Problems (2004) (2)
Causal multicast in unreliable networks for multimedia applications (1996) (2)
Minimal Synchrony for Asynchronous Byzantine Consensus (2015) (2)
STM Systems: Enforcing Strong Isolation between Transactions and Non-transactional Code (2012) (2)
Self-stabilizing Byzantine-tolerant Broadcast (2022) (2)
When and How Process Groups Can Be Used to Reduce the Renaming Space (2012) (2)
Fully Anonymous Shared Memory Algorithms (2019) (2)
Leader Election in Arbitrarily Connected Networks with Process Crashes and Weak Channel Reliability (2021) (2)
Quorum-Based Replication in Asynchronous Crash-Recovery Distributed Systems (Research Note) (2000) (2)
Software transactional memories: an approach for multicore programming (2011) (2)
The Power and Limit of Adding Synchronization Messages for Synchronous Agreement (2006) (2)
A Survey on Some Recent Advances in Shared Memory Models (2011) (2)
Relaxed Queues and Stacks from Read/Write Operations (2020) (2)
LOGICAL TIME : U Distributed Systems (2004) (2)
On Granularity of Events in Distributed Computations (1994) (2)
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms (2022) (2)
Asynchronous Distributed Checkpointing (2013) (2)
Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2 ) Messages, O(1) Time, and no Signature (2015) (2)
Enriching the reduction map of sub-consensus tasks (2011) (2)
Looking for Efficient Implementations of Concurrent Objects (2011) (2)
Self-stabilizing Byzantine- and Intrusion-tolerant Consensus (2021) (2)
An Informal Visit to the Wonderful Land of Consensus Numbers and Beyond (2019) (2)
Detecting Diamond Necklaces in Labeled Dags (A Problem from Distributed Debugging) (1996) (2)
From anarchy to geometric structuring: the power of virtual coordinates (2008) (2)
Timed Quorum System for Large-Scale and Dynamic Environments (2008) (2)
t-Resilient k-Immediate Snapshot and its Relation with Agreement Problems (2020) (2)
Time-efficient read/write register in crash-prone asynchronous message-passing systems (2016) (2)
Consistent state restoration in shared memory systems (1997) (2)
Loosely-self-stabilizing Byzantine-tolerant Binary Consensus for Signature-free Message-passing Systems (2021) (2)
An introduction to the renaming problem (2002) (2)
When all the observers of a distributed computation do agree (1994) (2)
The Eventual Clusterer Oracle and Its Application to Consensus in MANETs (2007) (2)
What Can Be Done with Consensus Number One: Relaxed Queues and Stacks (2020) (2)
Signature-Free Broadcast-Based Intrusion Tolerance (2010) (2)
Time and message-efficient S-based consensus (brief announcement) (2000) (2)
Consensus and Interactive Consistency in Synchronous Systems Prone to Process Crash Failures (2018) (2)
A simple protocol offering both atomic consistent read operations and sequentially consistent read operations (2005) (2)
From failure detectors with limited scope accuracy to system-wide leadership (2006) (2)
Trying to Unify the LL/SC Synchronization Primitive and the Notion of a Timed Register (2012) (2)
Asynchronous Byzantine Reliable Broadcast With a Message Adversary (2022) (1)
Time-Efficient RFID-Based Stocktaking with a Coarse-Grained Inventory List (2018) (1)
Real-time based strong consistency for distributed objects (2001) (1)
Adding Dynamicity to the Uncertainty that Characterizes Distributed Systems: Challenges Ahead (2009) (1)
Signature-Free Communication and Agreement in the Presence of Byzantine Processes (Tutorial) (2015) (1)
Brief Announcement: Leader Election in the ADD Communication Model (2020) (1)
Controlling knowledge transfers in distributed algorithms.Application to deadlock detection (1986) (1)
Implementation and Evaluation of Distributed Synchronization on a Distributed Memory Parallel Machine (1991) (1)
Extending the Causal Consistency Condition to any Object Defined by a Sequential Specification (2018) (1)
Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement (2012) (1)
Consistent Lamport Clocks for Asynchronous Groups with Process Crashes (1999) (1)
Building Read/Write Registers Despite Asynchrony and Less than Half of Processes Crash (t < n/2) (2018) (1)
From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach (2015) (1)
Principles of Distributed Systems, 13th International Conference, OPODIS 2009, Nîmes, France, December 15-18, 2009. Proceedings (2009) (1)
Generalized Symmetry Breaking Tasks (2013) (1)
Symmetry and Anonymity in Shared Memory Concurrent Systems (2022) (1)
Money Transfer Made Simple (2020) (1)
A New Insight into Local Coin-Based Randomized Consensus (2019) (1)
An Exercise in Concurrency: From Non-blocking Objects to Fair Objects (2014) (1)
Wait-freedom and Locality are not Incompatible (with Distributed Ring Coloring as an Example) (2016) (1)
Cliff-Edge Consensus: Agreeing on the Precipice (2013) (1)
Brief announcement: the price of anonymity: optimal consensus despite asynchrony, crash and anonymity (2009) (1)
Safe, Regular, and Atomic Read/Write Registers (2013) (1)
Recognition of Patterns on Control Flows for Debugging Distributed Executions (1995) (1)
Building TMR-Based Reliable Servers Despite Bounded Input Lifetimes (2001) (1)
Proceedings of the Workshop on Parallel and Distributed Algorithms Bonas, France (1988) (1)
Resilient Computing Curriculum (2009) (1)
A Symmetric Synchrony Condition for Solving Byzantine Consensus (2011) (1)
I S a P U B L I C a T I O N I N T E R N E N O I R I S a 1126 Communication-induced Determination of Consistent Snapshots Communication-induced Determination of Consistent Snapshots (1997) (1)
On the Versatility of Bracha's Byzantine Reliable Broadcast Algorithm (2021) (1)
About State Recording in Asynchronous Computations (Abstract). (1996) (1)
Logical Instantaneity and Causal Order: Two "First Class" Communication Modes for Parallel Computing (2000) (1)
I S a P U B L I C a T I O N I N T E R N E N O I R I S a Mutually Consistent Recording in Asynchronous Computations Mutually Consistent Recording in Asynchronous Computations (1996) (1)
Distributed Universality (2015) (1)
Solving Mutual Exclusion (2013) (1)
Fault-Tolerant Techniques for Concurrent Objects (2005) (1)
Replaying Distributed Executions (1995) (1)
A Linearizability-based Hierarchy for Concurrent Specifications (2022) (1)
Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version) (2017) (1)
Brief announcement: the synchronous condition-based consensus hierarchy (2004) (1)
A simple proof of the necessity of the failure detector Σ to implement a register in asynchronous message-passing systems (2010) (1)
A visit to mutual exclusion in seven dates (2022) (1)
Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties (2014) (1)
Anonymous asynchronous systems: the case of failure detectors (2012) (1)
A Universal Construction for Concurrent Objects (2007) (1)
Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure Detector (2019) (1)
κ𝓁-cast: On the Foundations of Byzantine Reliable Broadcast in the Presence of Message Adversaries (2022) (1)
Lock-Based Concurrent Objects (2013) (1)
Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings (2005) (1)
On the weakest information on failures to solve mutual exclusion and consensus in asynchronous crash-prone read/write systems (2021) (1)
Atomic Read/Write Registers in the Presence of Byzantine Processes (2018) (1)
k-Immediate Snapshot and x-Set Agreement: How Are They Related? (2020) (1)
Sequence-based global predicates for distributed computations : definitions and detection algorithms (1993) (1)
Brief Announcement: Fully Anonymous Shared Memory Algorithms (2019) (1)
Atomic Consistency (Linearizability) (2013) (1)
Software Transactional Memory: What? Why? How? A New Challenge? (2009) (1)
Renaming Objects from Read/Write Registers Only (2013) (0)
Distributed computability: Relating k-immediate snapshot and x-set agreement (2021) (0)
As Scalable As Possible:Foundations of large-scale dynamic systems (2007) (0)
The Read/Write Register Abstraction (2018) (0)
Atomicity: Formal Definition and Properties (2013) (0)
A Short Introduction to Synchronous Communication (2013) (0)
Consensus Numbers and the Consensus Hierarchy (2013) (0)
A Broadcast Abstraction Suited to the Family of Read/Write Implementable Objects (2018) (0)
Reliable Broadcast in the Presence of Process Crash Failures (2018) (0)
Reliable Logical Clocks For Unreliable Process Groups (2000) (0)
Revisiting Immediate Snapshot (2016) (0)
From Safe Bits to Atomic Bits: Lower Bound and Optimal Construction (2013) (0)
Simple Vector Clocks are limited to Solve some Causallity Related Problems (1999) (0)
Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast (2022) (0)
New Results - Resource management in peer to peer systems (2006) (0)
Workshop on Dependable Application Support for Self-Organizing Networks (DASSON 2007) (2007) (0)
On the fly estimation of the processes that are alive/crashed in an asynchronous message-passing system (2006) (0)
Distributed computing systems (1985) (0)
Coping with Byzantine Processes and a Message Adversary: Modularity Helps! (2022) (0)
New Results - Large-scale and user-centricdistributed systems (2013) (0)
A general definition of deadlocks for distributed systems (1995) (0)
Implementing Oracles in Asynchronous Systems Prone to Process Crash Failures (2018) (0)
focus Agreement Problems in Distributed Systems (2001) (0)
Consensus-Based Fault-Tolerant (2001) (0)
Simple distributed solutions to the readers-writers problem (1990) (0)
New Results - Peer-to-peer wireless autonomic networked systems (2007) (0)
Wait-Free Objects for Real-Time Systems? (Position paper) (2002) (0)
Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t<n/3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{- (2016) (0)
Challenges of Future Distributed Computing Systems (2003) (0)
Simulating Synchrony on Top of Asynchronous Systems (2013) (0)
Implementing Consensus in Enriched Byzantine Asynchronous Systems (2018) (0)
DMCSC: a fully distributed multi-coloring approach for scalable communication in synchronous broadcast networks (2022) (0)
Message from the ICDCSW 2010 organizers (2010) (0)
A condition for k-set agreement in asynchronous distributed systems (2001) (0)
Mobile Objects Navigating a Network (2013) (0)
Snapshot Objects from Read/Write Registers Only (2013) (0)
Brief Announcement: Self-stabilizing Total-Order Broadcast (2022) (0)
Towards a formal model for view maintenance in data warehouses (2002) (0)
Allowing Atomic Objects to Coexist with Sequentially Consistent Objects (2005) (0)
Reliable Broadcast in the Presence of Process Crashes and Unreliable Channels (2018) (0)
A Modular Approach to Construct Signature-Free BRB Algorithms Under a Message Adversary (2022) (0)
A distributed kernel for virtual time driven applications (1992) (0)
Distributed Graph Algorithms (2013) (0)
Order Constraints on Message Delivery (2013) (0)
Distributed Snapshots (2016) (0)
Circumventing the t n /2 Read/Write Register Impossibility: the Failure Detector Approach (2018) (0)
Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity (2022) (0)
Session details: Concurrent data structures and objects (2013) (0)
Panel on the contributions of the DISC community to distributed computing: a historical perspective (2006) (0)
Proceedings of the 13th International Conference on Principles of Distributed Systems (2009) (0)
Distributed Database Checkpointing Extended Abstract (2007) (0)
Self-stabilizing Uniform Reliable Broadcast (preliminary version) (2020) (0)
Une introduction a quelques techniques du controle distribué à travers un exemple (1986) (0)
Special issue on NETYS’14 selected papers (2016) (0)
Invocation Protocol on Object Replicas (2003) (0)
The rudiments of object distribution in a distributed system (1987) (0)
925 CONSISTENT CHECKPOINTING IN MESSAGE PASSING DISTRIBUTED SYSTEMS (1995) (0)
Other Grants and Activities - International grants (2006) (0)
A Snapshot-Based Introduction to the Linearizability Hierarchy (2022) (0)
Consensus: Power and Implementability Limit in Crash-Prone Asynchronous Systems (2018) (0)
Message Adversaries (2016) (0)
Distributed algorithms : 9th International Workshop, WDAG '95, Le Mont-Saint-Michel, France, September 13-15, 1995 : proceedings (1995) (0)
k-bounded set objects in eventually synchronous distributed systems with churn and continuous accesses (2011) (0)
Efficient Δ-causal broadcasting for multimedia applications (1996) (0)
D.1.2 – Modular quasi-causal data structures (2015) (0)
Brief Announcement: ΔΩ: Specifying an Eventual Leader Service for Dynamic Systems (2011) (0)
An Algorithmic Framework to Compute Global Functions on a Process Graph (2013) (0)
Proceedings 22nd International Conference on Distributed Computing Systems, 2-5 July 2002, Vienna, Austria (2002) (0)
Register in Crash-prone Asynchronous Message-Passing Systems (2019) (0)
Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems (2016) (0)
60 Years of Mastering Concurrent Computing through Sequential Thinking (2020) (0)
Brief announcement: veto number and the respective power of eventual failure detectors (2004) (0)
Implementing Consensus in Enriched Crash-Prone Asynchronous Systems (2018) (0)
Appending Atomically in Byzantine Distributed Ledgers (2020) (0)
Hybrid Concurrent Objects (2013) (0)
Permission-Based Mutual Exclusion Algorithms (2013) (0)
Quorum, Signatures, and Overlays (2018) (0)
Partnerships and Cooperations - European initiatives (2013) (0)
Reaching Consensus in the Presence of Contention-Related Crash Failures (2022) (0)
Special issue on NETYS’14 selected papers (2016) (0)
The Alpha(s) and Omega of Consensus: Failure Detector-Based Consensus (2013) (0)
An experience in implementing abstract data types (1981) (0)
Bounded Constructions of Atomic b-Valued Registers (2013) (0)
Consistent Checkpointing in Distributed Databases: Towards a Formal Approach (1999) (0)
Wait-Free Objects from Read/Write Registers Only (2013) (0)
Session details: R2 (2009) (0)
Consensus in Synchronous Systems Prone to Byzantine Process Failures (2018) (0)
Looking for the optimal conditions for solving set agreement (2008) (0)
Synchronization and Protection Features for Data Abstraction (1980) (0)
Message from the General Chairs: MSN 2022 (2022) (0)
The Case of Unreliable Base Objects (2013) (0)
From static distributed systems to dynamic systems: an approach for a first step (2006) (0)
Optimal Algorithms for Synchronous Byzantine k-Set Agreement (2022) (0)
Concurrent Crash-Prone Shared Memory Systems (2022) (0)
Bee's Strategy Against Byzantines Replacing Byzantine Participants - (Extended Abstract) (2018) (0)
Logical Time in Asynchronous Distributed Systems (2013) (0)
Expressing and Detecting General Control Flow Properties of Distributed Computations (2011) (0)
Good-Case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case (2023) (0)
Making Local Algorithms Wait-Free: the Case of Ring Coloring (2017) (0)
A Necessary and Sufficient Synchrony Condition for Solving Byzantine Consensus (2010) (0)
Non-blocking Atomic Commitment in the Presence of Process Crash Failures (2018) (0)
Mutex-Free Concurrent Objects (2013) (0)
DISC at Its 20th Anniversary (Stockholm, 2006) (2007) (0)
Concurrent Crash-Prone Shared Memory Systems: A Few Theoretical Notions (2022) (0)
U Distributed Systems (1996) (0)
Implementable Agreement Abstractions Despite Asynchrony and a Minority of Process Crashes (2018) (0)
A transaction-friendly binary search tree (2011) (0)
Corrigendum to "Mutual exclusion in fully anonymous shared memory systems" [Inf. Process. Lett. 158 (2020) 105938] (2023) (0)
Proceedings of the 12th international conference on Structural Information and Communication Complexity (2005) (0)
Session details: Session 12 (2015) (0)
Elements for a course om design of distributed algorithms (1992) (0)
Causality oriented shared memory for distribured systems (1992) (0)
The Synchronization Power (Consensus Number) of Access-Control Objects: The Case of AllowList and DenyList (2023) (0)
The logically instantaneous communication mode: a communication abstraction (2001) (0)
Distributed algorithms for static and dynamic termination detection (1995) (0)
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems Roy Friedman, Member, IEEE Computer Society, Achour Mostefaoui, and Michel Raynal (2005) (0)
Concurrent Programming: Algorithms, Principles, and Foundations - ReadingSample (2017) (0)
The Distributed Computing Column (2020) (0)
A Subjective Visit to Selected Topics in Distributed Computing (2007) (0)
Time-Eﬀicient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems (2022) (0)
DISC at its 20th anniversary: past, present and future (2006) (0)
Expediting Decision in Synchronous Systems Prone to Process Crash Failures (2018) (0)
Session details: Session 2 (2014) (0)
Resilient Computing Curriculum Draft -- ReSIST NoE Deliverable D16 (2007) (0)
Cycle Prevention in Distributed Checkpointing (1997) (0)
Leader Election Algorithms (2013) (0)
The 2010 Edsger W. Dijkstra Prize in Distributed Computing (2010) (0)
A Simple Predicate to Expedite the Termination of a Randomized Consensus Algorithm (2015) (0)
Nature of Distributed Computations and the Concept of a Global State (2013) (0)
Distributed Algorithms: 3rd International Workshop, Nice, France, September 26-28, 1989. Proceedings (1989) (0)
Distributed Computability (2021) (0)
New Results - Network and Graph Algorithms (2016) (0)
The Contention-Friendly Tree (2013) (0)
Implementing Train Applications Based on the Distributed Shared Memory Paradigm (1997) (0)
Fe b 20 20 Appending Atomically in Byzantine Distributed Ledgers ⋆ (2020) (0)
Self-stabilizing Total-order Broadcast (2022) (0)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface (2009) (0)
On the Consensus Number of Non-adaptive Perfect Renaming (2013) (0)
New Results - Models and abstractions: dealing with dynamics (2009) (0)
New Results - Resource management in large-scale dynamic systems (2008) (0)
Preface (2007) (0)
Consensus Variants: Simultaneous Consensus and k-Set Agreement (2018) (0)
Contention-related crash failures: Definitions, agreement algorithms, and impossibility results (2022) (0)
Communication Patterns and Input Patterns in Distributed Computing - (Invited Talk) (2015) (0)
Resilient Computing Courseware (2009) (0)
Rendezvous (Synchronous) Communication (2013) (0)
Distributed Deadlock Detection (2013) (0)
BUILDING AND USING P T-BASED QUORUMS DESPITE ANY NUMBER T OF PROCESS OF CRASHES (2003) (0)
Universality of Consensus (2013) (0)
Efficient Delta-Causal Broadcasting of Multimedia Applications (Abstract). (1996) (0)
Properties of communication modes in distributed systems (1995) (0)
Logical Clocks for Unreliable Process Groups (1999) (0)
Byzantine BG Simulations for Message-Passing Systems (2015) (0)
Extending Causal Consistency to any Object Defined by a Sequential Specification (2018) (0)
Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects (2021) (0)

This paper list is powered by the following services:

Other Resources About Michel Raynal

What Schools Are Affiliated With Michel Raynal?

Michel Raynal is affiliated with the following schools:

Michel Raynal's Academic­Influence.com Rankings