The following pages link to Rachid Guerraoui (Q453506):
Displaying 50 items.
- (Q197389) (redirect page) (← links)
- Verification of STM on relaxed memory models (Q453508) (← links)
- The impossibility of boosting distributed service resilience (Q550250) (← links)
- The disagreement power of an adversary (Q661056) (← links)
- Decentralized polling with respectable participants (Q663428) (← links)
- Generating fast indulgent algorithms (Q693079) (← links)
- The perfectly synchronized round-based model of distributed computing (Q879602) (← links)
- The gap in circumventing the impossibility of consensus (Q931725) (← links)
- Refined quorum systems (Q992512) (← links)
- Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks (Q1004318) (← links)
- A topological treatment of early-deciding set-agreement (Q1004319) (← links)
- On the hardness of failure-sensitive agreement problems. (Q1603446) (← links)
- \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores (Q1656883) (← links)
- The entropy of a distributed computation random number generation from memory interleaving (Q1656885) (← links)
- Optimal fair computation (Q1660930) (← links)
- Byzantine fireflies (Q1664126) (← links)
- Privacy-conscious information diffusion in social networks (Q1664160) (← links)
- On the smallest grain of salt to get a unique identity (Q1742759) (← links)
- The inherent price of indulgence (Q1953640) (← links)
- The overhead of consensus failure recovery (Q1954212) (← links)
- Anonymous and fault-tolerant shared-memory computing (Q1954238) (← links)
- Failure detectors as type boosters (Q1954255) (← links)
- The weakest failure detectors to boost obstruction-freedom (Q1954262) (← links)
- The weakest failure detector for eventual consistency (Q2010607) (← links)
- The consensus number of a cryptocurrency (Q2121054) (← links)
- Correction to: ``The consensus number of a cryptocurrency'' (Q2121055) (← links)
- Genuinely distributed Byzantine machine learning (Q2166362) (← links)
- Model checking transactional memories (Q2377134) (← links)
- On the weakest failure detector ever (Q2377264) (← links)
- Fast non-blocking atomic commit: an inherent trade-off (Q2390309) (← links)
- Of choices, failures and asynchrony: the many faces of set agreement (Q2428676) (← links)
- Reliable and total order broadcast in the crash-recovery model (Q2485143) (← links)
- Mutual exclusion in asynchronous systems with failure detectors (Q2485157) (← links)
- Computing in social networks (Q2637316) (← links)
- Removing algorithmic discrimination (with minimal individual error) (Q2672613) (← links)
- Atomic broadcast in a Byzantine model (Q2729985) (← links)
- Safety-liveness exclusion in distributed computing (Q2796260) (← links)
- The weakest failure detector for eventual consistency (Q2796274) (← links)
- The complexity of early deciding set agreement: how can topology help? (Q2810957) (← links)
- A note on set agreement with omission failures (Q2843714) (← links)
- The failure detector abstraction (Q2875042) (← links)
- On the liveness of transactional memory (Q2933772) (← links)
- Sharing is harder than agreeing (Q2934335) (← links)
- Secure communication over radio channels (Q2934337) (← links)
- On the complexity of asynchronous gossip (Q2934340) (← links)
- The complexity of robust atomic storage (Q2943384) (← links)
- The Complexity of Early Deciding Set Agreement (Q2999854) (← links)
- (Q3045849) (← links)
- (Q3046722) (← links)
- Introduction to Reliable and Secure Distributed Programming (Q3078444) (← links)
