The following pages link to Michel Raynal (Q269462):
Displaying 50 items.
- Implementing set objects in dynamic distributed systems (Q269463) (← links)
- From binary consensus to multivalued consensus in asynchronous message-passing systems (Q294742) (← links)
- Distributed universality (Q329296) (← links)
- A distributed leader election algorithm in crash-recovery and omissive systems (Q344564) (← links)
- Anonymous asynchronous systems: the case of failure detectors (Q360279) (← links)
- Towards a universal construction for transaction-based multiprocess programs (Q391265) (← links)
- Trust-aware peer sampling: performance and privacy tradeoffs (Q392002) (← links)
- The weakest failure detector to implement a register in asynchronous systems with hybrid communication (Q392012) (← links)
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- No double discount: condition-based simultaneity yields limited gain (Q418187) (← links)
- From the happened-before relation to the causal ordered set abstraction (Q433461) (← links)
- Using asynchrony and zero degradation to speed up indulgent consensus protocols (Q436832) (← links)
- Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations) (Q442277) (← links)
- The renaming problem in shared memory systems: an introduction (Q465682) (← links)
- On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems (Q555307) (← links)
- Help when needed, but no more: efficient read/write partial snapshot (Q663424) (← links)
- On-the-fly analysis of distributed computations (Q673006) (← links)
- A necessary condition for Byzantine \(k\)-set agreement (Q738885) (← links)
- From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation (Q868046) (← links)
- An impossibility about failure detectors in the iterated immediate snapshot model (Q975436) (← links)
- Anonymous graph exploration without collision by mobile robots (Q975538) (← links)
- Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures (Q987393) (← links)
- A note on atomicity: boosting Test\&Set to solve consensus (Q987831) (← links)
- A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems (Q990136) (← links)
- From adaptive renaming to set agreement (Q1008730) (← links)
- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound (Q1041222) (← links)
- Asynchronous bounded lifetime failure detectors (Q1041728) (← links)
- Stabilizing mobile philosophers (Q1041771) (← links)
- A distributed algorithm to prevent mutual drift between n logical clocks (Q1089788) (← links)
- \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion (Q1127529) (← links)
- Consistent records in asynchronous computations (Q1130161) (← links)
- The causal ordering abstraction and a simple way to implement it (Q1183422) (← links)
- Shared global states in distributed computations (Q1384536) (← links)
- (Q1603360) (redirect page) (← links)
- Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property (Q1603361) (← links)
- Restricted failure detectors: Definition and reduction protocols (Q1607001) (← links)
- Interval consistency of asynchronous distributed computations (Q1608322) (← links)
- Vertex coloring with communication and local memory constraints in synchronous broadcast networks (Q1629936) (← links)
- A pleasant stroll through the land of distributed machines, computation, and universality (Q1647312) (← links)
- Are Byzantine failures really different from crash failures? (Q1660936) (← links)
- Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract) (Q1664155) (← links)
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems (Q1686116) (← links)
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers (Q1741965) (← links)
- Prime numbers as a tool to design distributed algorithms (Q1823669) (← links)
- Consensus in Byzantine asynchronous systems (Q1827288) (← links)
- Rollback-dependency trackability: A minimal characterization and its protocol (Q1854416) (← links)
- Specification and verification of dynamic properties in distributed computations (Q1898183) (← links)
- Distributed algorithms for static and dynamic termination detection (Q1910618) (← links)
- Byzantine-tolerant causal broadcast (Q1981768) (← links)
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results (Q2078617) (← links)
