Rachid Guerraoui

Q: What Schools Are Affiliated With Rachid Guerraoui

Rachid Guerraoui is affiliated with the following schools: École Polytechnique Fédérale de Lausanne, Massachusetts Institute of Technology

Rachid Guerraoui's AcademicInfluence.com Rankings

Rachid Guerraoui

Computer Science

#1768

World Rank

#1832

Historical Rank

Database

#1148

World Rank

#1205

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Rachid Guerraoui Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Rachid Guerraoui is a Moroccan-Swiss computer scientist and a professor at the School of Computer and Communication Sciences at École Polytechnique Fédérale de Lausanne , known for his contributions in the fields of concurrent and distributed computing. He is an ACM Fellow and the Chair in Informatics and Computational Science for the year 2018–2019 at Collège de France for distributed computing.

(See a Problem?)

Rachid Guerraoui'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

The many faces of publish/subscribe (2003) (3514)
Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent (2017) (788)
Lightweight probabilistic broadcast (2001) (654)
Gossip-based peer sampling (2007) (561)
Epidemic information dissemination in distributed systems (2004) (554)
On the correctness of transactional memory (2008) (505)
Software-Based Replication for Fault Tolerance (1997) (455)
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations (2004) (384)
The Hidden Vulnerability of Distributed Learning in Byzantium (2018) (358)
The Next 700 BFT Protocols (2008) (329)
Introduction to Reliable and Secure Distributed Programming (2011) (318)
Stretching transactional memory (2009) (255)
STMBench7: a benchmark for software transactional memory (2007) (248)
Toward a theory of transactional contention managers (2005) (247)
Everything you always wanted to know about synchronization but were afraid to ask (2013) (246)
From Epidemics to Distributed Computing (2004) (244)
The Database State Machine Approach (2003) (238)
Introduction to reliable distributed programming (2006) (227)
Concurrency and distribution in object-oriented programming (1998) (182)
AOP: Does It Make Sense? The Case of Concurrency and Failures (2002) (176)
On objects and events (2001) (172)
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus (1995) (159)
Deconstructing paxos (2003) (151)
The Implementation of a CORBA Object Group Service (1998) (137)
Exploiting Atomic Broadcast in Replicated Databases (1998) (137)
The Generic Consensus Service (2001) (134)
Why STM can be more than a research toy (2011) (131)
The weakest failure detectors to solve certain fundamental problems in distributed computing (2004) (130)
Polymorphic Contention Management (2005) (129)
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated (2011) (128)
The information structure of indulgent consensus (2004) (127)
Fault-Tolerance by Replication in Distributed Systems (1996) (126)
Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures (2015) (126)
The design of a CORBA group communication service (1996) (125)
Introduction to Reliable and Secure Distributed Programming (2. ed.) (2011) (121)
Failure detectors as first class objects (1999) (117)
Elastic transactions (2009) (116)
Principles of Transactional Memory (2010) (116)
Streamflex: high-throughput stream programming in java (2007) (113)
Preventing versus curing: avoiding conflicts in transactional memories (2009) (106)
Personalized and Private Peer-to-Peer Machine Learning (2017) (106)
The Gossple Anonymous Social Network (2010) (104)
TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores (2017) (99)
Distributed Asynchronous Collections: Abstractions for Publish/Subscribe Interaction (2000) (97)
Genuine atomic multicast in asynchronous distributed systems (2001) (97)
Muteness Failure Detectors: Specification and Implementation (1999) (94)
The consensus number of a cryptocurrency (2019) (91)
ECOOP’ 99 — Object-Oriented Programming (1999) (88)
Asynchronous Byzantine Machine Learning (the case of SGD) (2018) (86)
Indulgent algorithms (preliminary version) (2000) (86)
Permissiveness in Transactional Memories (2008) (84)
Model checking transactional memories (2008) (83)
When Birds Die: Making Population Protocols Fault-Tolerant (2006) (80)
Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks (2006) (79)
Probabilistic multicast (2002) (78)
Reliable Distributed Storage (2009) (76)
Non-blocking atomic commit in asynchronous distributed systems with failure detectors (2002) (75)
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour (1999) (75)
Implementing e-Transactions with asynchronous replication (2000) (73)
Data-aware multicast (2004) (73)
Secure communication over radio channels (2008) (72)
Consensus: The Big Misunderstanding (1997) (71)
Consensus service: a modular approach for building agreement protocols in distributed systems (1996) (70)
Encapsulating Failure Detection: From Crash to Byzantine Failures (2002) (69)
AGGREGATHOR: Byzantine Machine Learning via Robust Gradient Aggregation (2019) (69)
How fast can a distributed atomic read be? (2004) (69)
A realistic look at failure detectors (2002) (69)
Privacy-preserving distributed collaborative filtering (2014) (68)
Type-Based Publish/Subscribe (2000) (68)
The semantics of progress in lock-based transactional memory (2009) (68)
Log-Free Concurrent Data Structures (2018) (66)
Anonymous and fault-tolerant shared-memory computing (2007) (66)
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures (2009) (64)
e-Transactions: End-to-End Reliability for Three-Tier Architectures (2002) (64)
On obstruction-free transactions (2008) (64)
Adaptive gossip-based broadcast (2003) (63)
The next 700 BFT protocols (2010) (62)
Throughput optimal total order broadcast for cluster environments (2010) (62)
Transaction Model vs. Virtual Synchrony Model: Bridging the Gap (1994) (62)
Refined quorum systems (2007) (61)
Implementation of the GARF replicated objects platform (1995) (61)
The Alpha of Indulgent Consensus (2007) (60)
Gossiping in a multi-channel radio network an oblivious approach to coping with malicious interference (2007) (60)
WHATSUP: A Decentralized Instant News Recommender (2013) (59)
The weakest failure detectors to boost obstruction-freedom (2006) (59)
Non blocking atomic commitment with an unreliable failure detector (1995) (59)
Mutual exclusion in asynchronous systems with failure detectors (2005) (59)
Stubborn Communication Channels (1998) (58)
One-phase commit: does it make sense? (1998) (58)
System support for object groups (1998) (58)
Interference-Resilient Information Exchange (2009) (58)
Mobile databases: a selection of open issues and research directions (2004) (58)
Robust Contention Management in Software Transactional Memory (2005) (58)
The disagreement power of an adversary (2011) (57)
Tight failure detection bounds on atomic object implementations (2010) (57)
Gossiping personalized queries (2010) (54)
FloDB: Unlocking Memory in Persistent Key-Value Stores (2017) (54)
Highly dynamic distributed computing with byzantine failures (2013) (53)
Fast Randomized Test-and-Set and Renaming (2010) (52)
The failure detector abstraction (2011) (52)
The complexity of obstruction-free implementations (2009) (52)
Gracefully Degrading Fair Exchange with Security Modules (2005) (50)
D2P: Distance-Based Differential Privacy in Recommenders (2015) (50)
Scalable atomic multicast (1998) (50)
Unifying Thread-Level Speculation and Transactional Memory (2012) (49)
Distributed Programming in GARF (1993) (49)
The wireless synchronization problem (2009) (49)
Shared Memory vs Message Passing (2003) (49)
Content-Based Publish/Subscribe with Structural Reflection (2001) (48)
Online Payments by Merely Broadcasting Messages (2020) (47)
Byzantine-Tolerant Machine Learning (2017) (46)
Fast byzantine agreement (2013) (46)
Computing with Reads and Writes in the Absence of Step Contention (2005) (46)
Total order multicast to multiple groups (1997) (46)
LiFTinG: Lightweight Freerider-Tracking in Gossip (2010) (45)
On the complexity of asynchronous gossip (2008) (44)
On verifying causal consistency (2016) (44)
GosSkip, an Efficient, Fault-Tolerant and Self Organizing Overlay Using Gossip-based Construction and Skip-Lists Principles (2006) (44)
Using the Strategy Design Pattern to Compose Reliable Distributed Protocols (1997) (44)
Incremental Consistency Guarantees for Replicated Objects (2016) (44)
Consensus in the Crash-Recover Model (1997) (44)
Transaction reordering in replicated databases (1997) (44)
How robust are gossip-based communication protocols? (2007) (43)
Robust emulations of shared memory in a crash-recovery model (2004) (43)
Fast Indulgent Consensus with Zero Degradation (2002) (43)
Flexible protocol composition in BAST (1998) (42)
Best-Case Complexity of Asynchronous Byzantine Consensus (2005) (42)
The inherent price of indulgence (2002) (42)
Heterogeneous Gossip (2009) (42)
X-Ability: a theory of replication (2000) (42)
Replication of CORBA Objects (1999) (41)
On the weakest failure detector ever (2007) (41)
Synchronous system and perfect failure detector: Solvability and efficiency issues (2000) (40)
Leveraging parallel nesting in transactional memory (2010) (40)
The Inherent Cost of Remembering Consistently (2018) (40)
The Weakest Failure Detector for Message Passing Set-Agreement (2008) (40)
Partial snapshot objects (2008) (40)
Toward personalized query expansion (2009) (40)
How fast can a very robust read be? (2006) (40)
Gossiping in a Multi-channel Radio Network (2007) (40)
Making BFT Protocols Really Adaptive (2015) (39)
$$\hbox {TM}^{2}$$TM2C: a software transactional memory for many-cores (2012) (39)
Completeness and Nondeterminism in Model Checking Transactional Memories (2008) (39)
HyRec: leveraging browsers for scalable recommenders (2014) (39)
Strategic directions in object-oriented programming (1996) (38)
Nesting Actions through Asynchronous Message Passing: the ACS Protocol (1992) (38)
Even Small Birds are Unique: Population Protocols with Identifiers (2007) (37)
On the liveness of transactional memory (2012) (37)
The Impact of RDMA on Agreement (2019) (36)
ProteusTM: Abstraction Meets Performance in Transactional Memory (2016) (36)
The Complexity of Renaming (2011) (36)
The Decentralized Non-Blocking Atomic Commitment Protocol (1995) (36)
Garf: a tool for programming reliable distributed applications (1997) (35)
Software Transactional Memory on Relaxed Memory Models (2009) (35)
"Gamma-Accurate" Failure Detectors (1996) (35)
Fast and Robust Memory Reclamation for Concurrent Data Structures (2016) (35)
Reducing the cost for non-blocking in atomic commitment (1996) (34)
A comparison of optimistic approaches to collaborative editing of Wiki pages (2007) (34)
Transactions are back---but are they the same? (2008) (34)
Predicting the Scalability of an STM: A Pragmatic Approach (2010) (33)
Causal Consistency and Latency Optimality: Friend or Foe? (2018) (33)
OS support for P2P programming: a case for TPS (2002) (33)
Fast Access to Distributed Atomic Memory (2010) (32)
An Equational Theory for Transactions (2003) (32)
What Can Be Implemented Anonymously? (2005) (32)
Programming with object groups in CORBA (2000) (32)
Lessons from Designing and Implementing GARF (1995) (32)
A pragmatic implementation of e-transactions (2000) (32)
Consensus Service: A Modular Approach For Building Fault-Tolerant Agreement Protocols in Distributed Systems (1996) (31)
Unlocking Energy (2016) (31)
Unconscious Eventual Consistency with Gossips (2006) (31)
Flexible task graphs: a unified restricted thread programming model for java (2008) (31)
How fast can eventual synchrony lead to consensus? (2005) (31)
Byzantine agreement with homonyms (2011) (31)
When Neurons Fail (2017) (31)
Microsecond Consensus for Microsecond Applications (2020) (30)
On the Weakest Failure Detector for Non-Blocking Atomic Commit (2002) (30)
FLeet: Online Federated Learning via Staleness Awareness and Performance Prediction (2020) (30)
Replicating objects using the CORBA Event Service? (1997) (29)
Boosting Gossip for Live Streaming (2010) (29)
Independent faults in the cloud (2010) (28)
Event systems. How to have your cake and eat it too (2002) (28)
Passing Messages while Sharing Memory (2018) (28)
OO distributed programming is not distributed OO programming (1999) (28)
Secretive Birds: Privacy in Population Protocols (2007) (28)
High Throughput Total Order Broadcast for Cluster Environments (2006) (28)
Reducing noise in gossip-based reliable broadcast (2001) (27)
Dividing Transactional Memories by Zero (2008) (27)
Genuinely distributed Byzantine machine learning (2019) (27)
Consensus: the big misunderstanding [distributed fault tolerant systems] (1997) (26)
Protocol Classes for Designing Reliable Distributed Environments (1996) (26)
On the consistency problem in mobile distributed computing (2002) (25)
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement (2009) (25)
Generalized Universality (2011) (25)
Optimistic Erasure-Coded Distributed Storage (2008) (24)
Decentralized polling with respectable participants (2009) (24)
How Fast can a Distributed Transaction Commit? (2017) (24)
Reliable distributed computing on unreliable radio channels (2009) (24)
Opacity: A Correctness Condition for Transactional Memory (2007) (24)
Replication Techniques for Availability (2010) (24)
Optimistic concurrency with OPTIK (2016) (24)
Dynamic Safe Interruptibility for Decentralized Multi-Agent Reinforcement Learning (2017) (23)
Genuine Atomic Multicast (1997) (23)
Stretching gossip with live streaming (2009) (23)
Lucky Read/Write Access to Robust Atomic Storage (2006) (23)
Filtering duplicated invocations using symmetric proxies (1995) (23)
Speculative linearizability (2012) (23)
The CORBA object group service (1997) (23)
Reflexes: abstractions for highly responsive systems (2007) (23)
Democratizing transactional programming (2011) (22)
Towards a theory of transactional contention managers (2006) (21)
Dynamic Byzantine Reliable Broadcast (2020) (21)
The Velox Transactional Memory Stack (2010) (21)
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement (2005) (21)
Dictatorial Transaction Processing: Atomic Commitment Without Veto Right (2002) (21)
Collaborative Learning in the Jungle (Decentralized, Byzantine, Heterogeneous, Asynchronous and Nonconvex Learning) (2020) (21)
Abstractions for devising Byzantine-resilient state machine replication (2000) (21)
Tight Bounds for Asynchronous Renaming (2014) (20)
A general characterization of indulgence (2006) (20)
Failure Detection Lower Bounds on Registers and Consensus (2002) (20)
Object-Based Distributed Programming (1993) (20)
Distributed Momentum for Byzantine-resilient Stochastic Gradient Descent (2021) (20)
On the hardness of failure-sensitive agreement problems (2001) (20)
The overhead of consensus failure recovery (2007) (20)
Collaborative personalized top-k processing (2011) (20)
Asynchronous gossip (2013) (19)
A High Throughput Atomic Storage Algorithm (2007) (19)
\??accurate" Failure Detectors (1996) (19)
Model Checking a Networked System Without the Network (2011) (19)
Effective multicast programming in large scale distributed systems (2001) (19)
Distributed programming with typed events (2004) (19)
Amnesic Distributed Storage (2007) (19)
ESTIMA: extrapolating scalability of in-memory applications (2016) (18)
The disagreement power of an adversary: extended abstract (2009) (18)
CORBA fault-tolerance: why it does not add up (1999) (18)
How to Solve Consensus in the Smallest Window of Synchrony (2008) (18)
A generic framework for indulgent consensus (2003) (18)
Atomic Object Composition (1994) (18)
Towards Reliable CORBA: Integration vs. Service Approach (1997) (18)
On the Robustness of a Neural Network (2017) (18)
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) (2010) (18)
SGD: Decentralized Byzantine Resilience (2019) (18)
Computing in social networks (2010) (17)
Privacy-Conscious Information Diffusion in Social Networks (2015) (17)
Building Reliable Client-Server Software Using Actively Replicated Objects (1995) (17)
Frugal Event Dissemination in a Mobile Environment (2005) (17)
The perfectly synchronized round-based model of distributed computing (2007) (17)
Reducing Fair Exchange to Atomic Commit (2005) (17)
Transactions in the jungle (2010) (17)
Scalable and Secure Polling in Dynamic Distributed Networks (2012) (17)
Securing every bit: authenticated broadcast in radio networks (2010) (16)
Failure detectors as type boosters (2008) (16)
Of Malicious Motes and Suspicious Sensors (2008) (16)
Trade-offs in Replicated Systems (2016) (16)
Hierarchical Probabilistic Multicast (2001) (16)
Asynchronous leasing (2002) (16)
Reliable and total order broadcast in the crash-recovery model (2005) (15)
How to Allocate Tasks Asynchronously (2012) (15)
Linearizability Is Not Always a Safety Property (2014) (15)
State Machine Replication Is More Expensive Than Consensus (2018) (15)
Never Say Never -- Probabilistic and Temporal Failure Detectors (2016) (14)
Evaluating CORBA portability: the case of an object group service (1998) (14)
Atomic Updates of Replicated Data (1996) (14)
Monotonic Prefix Consistency in Distributed Systems (2017) (14)
Fast non-blocking atomic commit: an inherent trade-off (2004) (14)
Tolerating Arbitrary Failures with State Machine Replication (2005) (14)
Fast and Secure Distributed Learning in High Dimension (2019) (14)
A leader election protocol for eventually synchronous shared memory systems (2006) (14)
Experiences with object group systems (2000) (13)
Sharing is harder than agreeing (2008) (13)
Online Payments by Merely Broadcasting Messages (Extended Version) (2020) (13)
A topological treatment of early-deciding set-agreement (2006) (13)
Fast and Differentially Private Algorithms for Decentralized Collaborative Machine Learning (2017) (13)
Modular Atomic Objects (1995) (13)
Distributed Momentum for Byzantine-resilient Learning (2020) (13)
Synchronizing without locks is inherently expensive (2006) (13)
To Transmit Now or Not to Transmit Now (2015) (12)
Putting OO distributed programming to work (1999) (12)
Composing Relaxed Transactions (2013) (12)
Leaderless Consensus (2021) (12)
An Efficient Universal Construction for Message-Passing Systems (2002) (12)
Byzantine Fireflies (2015) (12)
The collective memory of amnesic processes (2008) (12)
Abstracting Multi-Core Topologies with MCTOP (2017) (12)
What object-oriented distributed programming does not have to be, and what it may be (1999) (12)
Lock–Unlock (2019) (12)
On Failure Detectors and Type Boosters (2003) (12)
The PCL theorem: transactions cannot be parallel, consistent and live (2014) (12)
Locking Made Easy (2016) (12)
LiFTinG: Lightweight Freerider-Tracking Protocol in Gossip (2010) (11)
Extensible encoding of type hierarchies (2008) (11)
Strategic Research Directions in Object Oriented Programming (1996) (11)
The GARF library of DSM consistency models (1994) (11)
On the Message Complexity of Indulgent Consensus (2007) (11)
Consensus inside (2014) (11)
From Unreliable Objects to Reliable Objects: The Case of Atomic Registers and Consensus (2007) (11)
A Note on Set Agreement with Omission Failures (2003) (11)
On transaction liveness in replicated databases (1997) (10)
FeGAN: Scaling Distributed GANs (2020) (10)
Collaborative filtering under a sybil attack: analysis of a privacy threat (2015) (10)
Differential Privacy and Byzantine Resilience in SGD: Do They Add Up? (2021) (10)
Heterogeneous Recommendations: What You Might Like To Read After Watching Interstellar (2017) (10)
Introducing speculation in self-stabilization: an application to mutual exclusion (2013) (10)
Pervasive Computing with Frugal Objects (2007) (10)
WhatsUp: News, From, For, Through, Everyone (2010) (10)
Designing ASCY-compliant Concurrent Search Data Structures (2014) (10)
On tracking freeriders in gossip protocols (2009) (10)
GosSkip: a Gossip-based Structured Overlay Network for Efficient Content-based Filtering (2004) (10)
AT2: Asynchronous Trustworthy Transfers (2018) (10)
Finding trojan message vulnerabilities in distributed systems (2014) (10)
I Know Nothing about You But Here is What You Might Like (2017) (10)
-Reliable Broadcast: A Probabilistic Measure of Broadcast Reliability (2004) (10)
(Almost) All Objects Are Universal in Message Passing Systems (2005) (9)
A generic multicast primitive to support transactions on replicated objects in distributed systems (1995) (9)
Transactional Memory. Foundations, Algorithms, Tools, and Applications (2015) (9)
Mobility Friendly Publish/Subscribe (2004) (9)
Reliable broadcast in the crash-recovery model (2000) (9)
Asynchronous Byzantine Machine Learning (2018) (9)
Reliability with CORBA Event Channels (1997) (9)
Modeling Protocols as Objects for Structuring Reliable Distributed Systems (1997) (9)
The weakest failure detector for eventual consistency (2015) (9)
Reusable Concurrent Data Types (2014) (9)
Programming Fault-Tolerant Applications Using Two Orthogonal Object Levels (1993) (9)
Automated vulnerability discovery in distributed systems (2011) (9)
The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit (2012) (9)
How Live Can a Transactional Memory Be (2009) (9)
Atum: Scalable Group Communication Using Volatile Groups (2016) (9)
When Neurons Fail - Technical Report (2016) (8)
Toward personalized peer-to-peer top-k processing (2009) (8)
Scalable and Secure Aggregation in Distributed Networks (2011) (8)
The Driving Philosophers (2004) (8)
Who started this rumor? Quantifying the natural differential privacy guarantees of gossip protocols (2019) (8)
The Complexity of Early Deciding Set Agreement (2011) (8)
Differentially Private Stochastic Coordinate Descent (2020) (8)
Early Deciding Synchronous Renaming in O( logf ) Rounds or Less (2012) (8)
Byzantine Machine Learning Made Easy by Resilient Averaging of Momentums (2022) (8)
Efficient Multi-word Compare and Swap (2020) (8)
Fingerprinting Big Data: The Case of KNN Graph Construction (2019) (8)
Reflexes: Abstractions for integrating highly responsive tasks into Java applications (2010) (8)
An Equivalence Between Data Poisoning and Byzantine Gradient Attacks (2022) (7)
A Distributed Polling with Probabilistic Privacy (2013) (7)
Simulating Few by Many : Limited Concurrency = Set Consensus ( Extended Abstract ) (2009) (7)
Transactional Memory: Glimmer of a Theory (2009) (7)
Mobile Databases: A Report on Open Issues and Research Directions (2003) (7)
Scalable Byzantine Reliable Broadcast (Extended Version) (2019) (7)
Efficient distributed subtyping tests (2007) (7)
Can 100 Machines Agree? (2019) (7)
AKSEL: Fast Byzantine SGD (2020) (7)
Dynamic Byzantine Reliable Broadcast [Technical Report] (2020) (7)
On the Unfairness of Blockchain (2018) (7)
On the Strategyproofness of the Geometric Median (2021) (7)
Concurrency, distribution and parallelism in object oriented programming (1997) (7)
Pragmatic type interoperability (2003) (7)
Sequences, Items And Latent Links: Recommendation With Consumed Item Packs (2017) (6)
Middleware 2001: IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, Germany, November 12-16, 2001, Proceedings (2001) (6)
Capturing the Moment: Lightweight Similarity Computations (2017) (6)
Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg (2001) (6)
Who's On Board?: Probabilistic Membership for Real-Time Distributed Control Systems (2016) (6)
The complexity of robust atomic storage (2011) (6)
Frugal Mobile Objects (2005) (6)
Linguistic support for distributed programming abstractions (2004) (6)
Frugal Byzantine Computing (2021) (6)
Tight Bounds on Early Local Decisions in Uniform Consensus (2003) (6)
Limiting the Spread of Fake News on Social Media Platforms by Evaluating Users' Trustworthiness (2018) (6)
The Impossibility of Boosting Distributed Service Resilience (2005) (6)
Support for Collaborative Object-Oriented Development (1995) (6)
Linguistic Support for Large-Scale Distributed Programming (2001) (6)
Smaller, Faster & Lighter KNN Graph Constructions (2020) (6)
Group Programming: an Object-Oriented Approach (1995) (6)
The entropy of a distributed computation random number generation from memory interleaving (2018) (5)
Snapshot Isolation Does Not Scale Either (2013) (5)
BGP-Based Clustering for Scalable and Reliable Gossip Broadcast (2004) (5)
A Smooth Concurrency Revolution with Free Objects (2007) (5)
Strategy Pattern for composing Reliable Distributed Protocols (1996) (5)
Distributed Transactional Systems Cannot Be Fast (2019) (5)
Blockchain Protocols : The Adversary is in the Details (2018) (5)
A Classification of Various Approaches for Object-Based Parallel and Distributed Prgramming (1999) (5)
Strategyproof Learning: Building Trustworthy User-Generated Datasets (2021) (5)
Generating Fast Indulgent Algorithms (2011) (5)
An Arbitrary Tree-Structured Replica Control Protocol (2008) (5)
Generalizing the Correctness of Transactional Memory (2009) (5)
Towards safe distributed application development (2004) (5)
Finally the Weakest Failure Detector for Non-Blocking Atomic Commit (2003) (5)
Towards Fair Event Dissemination (2007) (5)
Programming with Object Groups in PHOENIX (1995) (5)
Safety-Liveness Exclusion in Distributed Computing (2015) (5)
The Complexity of Asynchronous Byzantine Consensus (2004) (5)
Delta-Reliability: A Probabilistic Measure of Broadcast Reliability (2004) (5)
Reliable CORBA Event Channels (1997) (5)
Transactional Exactly-once (1999) (5)
Virtuously Safe Reinforcement Learning (2018) (5)
One Acceptor is Enough (2010) (5)
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (2010) (5)
Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free (2016) (5)
Collaborative Filtering Under a Sybil Attack: Similarity Metrics do Matter! (2018) (5)
The Complexity of Early Deciding Set Agreement: How can Topology help? (2009) (5)
/spl Delta/-reliable broadcast: a probabilistic measure of broadcast reliabillity (2004) (4)
Distributed Computing, 18th International Conference, DISC 2004, Amsterdam, The Netherlands, October 4-7, 2004, Proceedings (2004) (4)
Toward modular concurrency control for object-oriented distributed systems (1993) (4)
Asynchronous Byzantine Consensus: Complexity, Resilience and Authentication (2004) (4)
Invocation Support for Replicated Objects (1995) (4)
Fast and Robust Distributed Learning in High Dimension (2020) (4)
As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy! (2022) (4)
Nested Transactions: Reviewing the Coherence Contract (1995) (4)
The Gap in Circumventing the Consensus Impossibility (2004) (4)
Concurrency as a Random Number Generator - Technical Report (2016) (4)
GARFIELD: System Support for Byzantine Machine Learning (Regular Paper) (2021) (4)
Abstractions for Distributed Interaction : Guests or Relatives ? (2000) (4)
Source Routing in Time-Varing Lossy Networks (2015) (4)
uKharon: A Membership Service for Microsecond Applications (2022) (4)
Concurrent Programming Paradigms, A Comparison in Scala (2009) (4)
Guest Editors' introduction (1997) (4)
Genuine Atomic Multicast in Asynchronous Systems (1998) (4)
What dependability for networks of mobile sensor (2005) (4)
Personalizing Top-k Processing Online in a Peer-to-Peer Social Tagging Network (2014) (4)
The Utility and Privacy Effects of a Click (2017) (4)
Brief Announcement: Byzantine-Tolerant Machine Learning (2017) (4)
Collaborative Learning as an Agreement Problem (2020) (4)
Transactors: Unifying Transactions and Actors (2009) (3)
Bast, A Framework for Reliable Distributed Computing (1997) (3)
Exactly-Once Transactions (2000) (3)
Atomic Multicast harder than Atomic Broadcast (1996) (3)
Dealing with atomicity in object-based distributed systems (1992) (3)
Right on Time Distributed Shared Memory (2016) (3)
An open framework for reliable distributed computing (2000) (3)
ESTIMA (2017) (3)
Robust P2P Personalized Learning (2020) (3)
Brief Announcement: New Bounds for Partially Synchronous Set Agreement (2010) (3)
Tracking freeriders in gossip-based content dissemination systems (2014) (3)
Impossibility of Boosting Distributed Service (2005) (3)
Thinking objectively: object-oriented abstractions for distributed programming (1999) (3)
On the use of Smalltalk for Concurrent and Distributed Programming (1996) (3)
Fast Machine Learning with Byzantine Workers and Servers (2019) (3)
Brief announcement: transaction polymorphism (2011) (3)
The PCL Theorem (2018) (3)
Local Model Checking (2011) (3)
What Dependability for Networks of Mobile Sensors (2005) (3)
A Classi cation of Various Approachesfor Object-Based Parallel andDistributed Programming (1996) (3)
Dynamic Path Selection for Source Routing in Time-Varying Lossy Networks (2015) (3)
A paradox of eventual linearizability in shared memory (2014) (3)
Heterogeneous Gossiping (2016) (3)
Proceedings of the 13th European Conference on Object-Oriented Programming (1999) (3)
LiFT: Lightweight Freerider-Tracking Protocol (2008) (3)
Combining Differential Privacy and Byzantine Resilience in Distributed SGD (2021) (3)
Why You Can't Beat Blockchains: Consistency and High Availability in Distributed Systems (2017) (3)
Right Abstractions on Adequate Frameworks for Building Adaptable Distributed Applications (1997) (3)
Gossiping Capabilities (2008) (3)
Optimal Fair Computation (2016) (3)
Lessons from implementing active objects on a parallel machine (1992) (3)
Brief Announcement: Towards Secured Distributed Polling in Social Networks (2009) (3)
Distributed programming abstractions (1996) (2)
Open consensus (2001) (2)
Early Local Decisions in Distributed Agreement (2003) (2)
Hide & Share: Landmark-Based Similarity for Private KNN Computation (2015) (2)
The gap in circumventing the impossibility of consensus (2008) (2)
On the cost of composing shared-memory algorithms (2012) (2)
Personalized Web Search by Gossiping with Unknown Social Acquaintances (2009) (2)
Revisiting Tendermint: Design Tradeoffs, Accountability, and Practical Use (2022) (2)
Removing Algorithmic Discrimination (With Minimal Individual Error) (2018) (2)
Predicting complex genetic phenotypes using error propagation in weighted networks (2018) (2)
Loosely coupled components (2002) (2)
The Benefits of Entropy in Population Protocols (2015) (2)
Patterns in SNMP-Based Network Management (2004) (2)
The Time-Complexity of Local Decision in Distributed Agreement (2007) (2)
Brief announcement: byzantine agreement with homonyms (2010) (2)
Stabilization, Safety, and Security of Distributed Systems (SSS 2009) (2011) (2)
Atomic Updates of Replicated Objects (1996) (2)
Composition vs Concurrency (2010) (2)
Crime and Punishment in Distributed Byzantine Decision Tasks (2022) (2)
uBFT: Microsecond-Scale BFT using Disaggregated Memory (2023) (2)
Nested Transaction: Reviewing the Coherency Contract (1993) (2)
Active Objects on Parallel Machines: a Case Study (1992) (2)
Abortable Linearizable Modules (2012) (2)
The Disclosure Power of Shared Objects (2017) (2)
Deep Learning Works in Practice. But Does it Work in Theory? (2018) (2)
The Probabilistic Fault Tolerance of Neural Networks in the Continuous Limit (2019) (2)
The GARF System: Overview, Design and Implementation (1997) (2)
Verification of STM on relaxed memory models (2011) (2)
Collaborative scoring with dishonest participants (2010) (2)
Generalizing State Machine Replication (2010) (2)
DIABLO: A Distributed Analytical Blockchain Benchmark Framework Focusing on Real-World Workloads (2021) (2)
A Scalable and Oblivious Atomicity Assertion (2008) (2)
Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony! (2022) (2)
The Fake News Vaccine - A Content-Agnostic System for Preventing Fake News from Becoming Viral (2019) (2)
The Weight-Watcher Service and its Lightweight Implementation (2007) (1)
Fault-Tolerant Techniques for Concurrent Objects (2005) (1)
Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version] (2022) (1)
The Theory of Transactional Memory (2009) (1)
Failure Detectors (2008) (1)
The Impact of RDMA on Agreement [ Extended Version ] (2019) (1)
Distributed Transactions: Dissecting the Nightmare (2018) (1)
The Fake News Vaccine (2019) (1)
Special issue: European Conference on Object‐oriented Programming 1999 (2000) (1)
On Dynamic Distributed Computing (2012) (1)
High-Performance Transactional Event Processing (2009) (1)
Privacy-preserving distributed collaborative filtering (2015) (1)
The weakest failure detector for eventual consistency (2017) (1)
Modern Security with Traditional Distributed Algorithms (2004) (1)
Profiling Transactional Applications (2015) (1)
A Pragmatic Approach for Predicting the Scalability of Parallel Applications (2012) (1)
A Universal Construction for Concurrent Objects (2007) (1)
Lightweight Probabilistic Broadcast £ Ý (2004) (1)
Dependable Distributed Middleware : Pay Now or Pay Later! (2003) (1)
ECOOP '99 - Object-Oriented Programming: 13th European Conference Lisbon, Portugal, June 14-18, 1999 Proceedings (1999) (1)
Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols (2020) (1)
Making Byzantine Decentralized Learning Efficient (2022) (1)
Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2009) (2009) (1)
Unified and Scalable Incremental Recommenders with Consumed Item Packs (2019) (1)
A Pragmatic Implementation of E-transactions * Internal Accession Date Only a Pragmatic Implementation of E-transactions (2000) (1)
SoK: On the Impossible Security of Very Large Foundation Models (2022) (1)
Distributed Computing: 18th International Conference, DISC 2004, Amsterdam, The Netherlands, October 4-8, 2004. Proceedings (Lecture Notes in Computer Science) (2004) (1)
Special issue: European Conference on Object-oriented Programming 1999 (2000) (1)
Diablo: A Benchmark Suite for Blockchains (2023) (1)
LiFTinG: Lightweight protocol for Freerider-Tracking in Gossip (2011) (1)
Making Consensus Practical (2000) (1)
Fixing by Mixing: A Recipe for Optimal Byzantine ML under Heterogeneity (2023) (1)
Concurrency as a Random Number Generator (2016) (1)
Using the Topological Characterization of Synchronous Models (2003) (1)
Oracular Byzantine Reliable Broadcast (2022) (1)
Frugal topology construction for stream aggregation in the cloud (2016) (1)
Garfield: System Support for Byzantine Machine Learning (2020) (1)
Boosting Obstruction-Freedom with Low Overhead (2006) (1)
Can AIs learn to avoid human interruption? (2017) (1)
The Overhead of Indulgent Failure Recovery (2006) (1)
Locking Timestamps versus Locking Objects (2018) (1)
The Impossibility of Fast Transactions (2020) (1)
The Imitation Game: Algorithm Selection by Exploiting Black-Box Recommenders (2020) (1)
Proceedings of the Workshop on Object-Based Distributed Programming (1993) (1)
Learning to Gather without Communication (2018) (1)
Foundations of Speculative Distributed Computing - (Invited Lecture Extended Abstract) (2010) (1)
uBFT: Microsecond-scale BFT using Disaggregated Memory [Extended Version] (2022) (1)
Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings (2009) (1)
Operation-Level Wait-Free Transactional Memory with Support for Irrevocable Operations (2017) (1)
Catch Me If You Can Privacy-Preserving Dissemination in Micro-Blogging (2014) (1)
Correction to: The consensus number of a cryptocurrency (2022) (1)
Asynchronous Leasing (Extended Abstract) (2002) (1)
The 2009 Edsger W. Dijkstra Prize in Distributed Computing (2009) (0)
Atomic Broadcast In A Byzantine Model (2000) (0)
Verifying Concurrent Data Structures Using Data-Expansion Technical Report (2014) (0)
Trustful Cumulus Clouds (2010) (0)
Gathering with extremely restricted visibility (2019) (0)
OS Support for P2P: a Case for TPS (2002) (0)
Fast Byzantine SGD (video) (2020) (0)
SurferMonkey: A Decentralized Anonymous Blockchain Intercommunication System via Zero Knowledge Proofs (2022) (0)
GoldFinger: Fast & Approximate Jaccard for Efficient KNN Graph Constructions (2022) (0)
Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search (2023) (0)
Robust Concurrent Computing (2012) (0)
Session details: Consensus (2005) (0)
Democratrizing the Parliament (2001) (0)
This paper is included in the Proceedings of the 2022 USENIX Annual Technical Conference. uKharon: A Membership Service for Microsecond Applications (2022) (0)
Transactional Memory : Glimmer of a Theory ( Invited Paper ) (2009) (0)
Revised Selected Papers of the First International Conference on Networked Systems - Volume 7853 (2013) (0)
Demystifying Bitcoin (Keynote Abstract) (2019) (0)
Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (2009) (0)
F ast Byzantine Agreement (2013) (0)
Distributed Learning with Curious and Adversarial Machines (2023) (0)
The CHT Play (2004) (0)
SPADE: Tuning scale-out OLTP on modern RDMA clusters (2018) (0)
Beyond One Third Byzantine Failures (2015) (0)
Editorial: Middleware (2003) (0)
Oracular Byzantine Reliable Broadcast [Extended Version] (2022) (0)
Dissecting Distributed Computations (2003) (0)
Thread-Placement Learning (2020) (0)
The Return of Transactions (2008) (0)
Correction to: The consensus number of a cryptocurrency (2022) (0)
Computer Science and Artificial Intelligence Laboratory Impossibility of Boosting Distributed Service Resilience (2005) (0)
Special issue on NETYS selected papers (2015) (0)
banner above paper title Transaction Polymorphism in Java (2011) (0)
Towards Fair Event Dissemination Position Paper (2007) (0)
An Equational Theory for Transa tions ? (2003) (0)
Transaction Polymorphism in Java (2011) (0)
Concurrency as a Random Number Generator - Companion Technical Report (2016) (0)
A User-aware Clicking Platform for Recommenders (2016) (0)
Ensuring Irrevocability in Wait-free Transactional Memory (2016) (0)
Carbon: An Asynchronous Voting-Based Payment System for a Client-Server Architecture (2022) (0)
Indulgent Algorithms ∗ (Extended Abstract) (2002) (0)
FLeet: Online Federated Learning via Staleness Awareness and Performance Prediction (2022) (0)
Object Replication Support in GARF: Which Group Service to Implement Object Groups? (1994) (0)
The Entropy of a Distributed Computing Schedule - the Example of Population Protocols (2015) (0)
Distributed Algorithms (2014) (0)
Community-Aware Event Dissemination (2006) (0)
Title: Peer-topeer Implementation and Theory Deliverable No: D2.7 First Progress Report on Distributed Algorithms (report) Due Date: Project Month 12 Revised Delivery Date: 2003-03-25 (2001) (0)
Object-Based Distributed Programming, ECOOP '93 Workshop, Kaiserslautern, Germany, July 26-27, 1993 (1994) (0)
Coping with the Process Proliferation Problem in Concurrent Object-Based Language Implementations (1992) (0)
The Cost of Scaling a Reliable Interconnection Topology (2020) (0)
Workshop on Reliable Middleware (1999) (0)
A comparison in Scala (2009) (0)
On the advantages of P2P ML on mobile devices (2022) (0)
Collision-Free Pattern Formation (2016) (0)
Progress Report on Algorithms and Applications of Probabilistic Reliable Broadcast (0)
Transactional Memory Repair (2012) (0)
Byzantine-Resilient Multi-Agent System (2021) (0)
Message from Symposium Chair (2020) (0)
New Results - Communication and Fault Tolerance inDistributed Networks (2013) (0)
Sequential Proximity - Towards Provably Scalable Concurrent Search Algorithms (2017) (0)
Generalizing State Machine Replication ( Preliminary Version ) (2010) (0)
Probabilistic and temporal failure detectors for solving distributed problems (2021) (0)
Strategy Pattern for ComposingReliable Distributed ProtocolsBenô (1996) (0)
Accelerating Transfer Learning with Near-Data Computation on Cloud Object Stores (2022) (0)
Dependable distributed object systems (1997) (0)
A General Characterization of Indulgence (Invited Paper) (2006) (0)
The LEAF platform: incremental enhancements for the J2EE (2002) (0)
Chapter 2 Replication Techniques for Availability (2009) (0)
Exploring the Borderlands of the Gathering Problem (2019) (0)
Guest Editorial: Special Section on Middleware Infrastructures (2003) (0)
Operating Systems What object oriented distributed programming (1999) (0)
Special issue on NETYS selected papers (2015) (0)
On the Validity of Consensus (2023) (0)
Computing in Social Networks I,II (2013) (0)
Obstruction degree: measuring concurrency in shared memory systems (2012) (0)
Velos: One-sided Paxos for RDMA applications (2021) (0)
Editorial - High Availability in CORBA (1998) (0)
The Universal Gossip Fighter (2022) (0)
Computing and maintaining an Overlay over a dynamic and unstructured network (2011) (0)
22 : 2 Scalable Byzantine Reliable Broadcast 1 (2019) (0)
A Multicast Framework in Support of Scalable Monitoring Systems for Telecommunication Networks (0)
Stretching Gossip with Live Streaming (experience report) (2009) (0)
The 2013 principles of distributed computing doctoral dissertation award (2013) (0)
Never Say Never Probabilistic & Temporal Failure Detectors (Extended) (2016) (0)
Wide Quorum Systems (2007) (0)
Local Model Checking EPFL Technical Report LPD-REPORT-163963 (2011) (0)
Democratizing the Parliament (2001) (0)
Asynchronous Byzantine Consensus : Complexity , Resilience and Authentication ( Preliminary Version ) (2004) (0)
G-Fake: Tell Me How It is Shared and I Shall Tell You If It is Fake (2022) (0)
Who started this gossip? Differentially private rumor spreading (2018) (0)
Distributed programming for dummies: a shifting transformation technique (2003) (0)
Granularity Issues in Implementing Active Objects on a Parallel Machine (1993) (0)
Host-Pathongen Co-evolution Inspired Algorithm Enables Robust GAN Training (2020) (0)
The CHT play : An Informal Note on the Necessary Part of the Proof that Ω is the Weakest Failure Detector for Consensus (2004) (0)
Special section with selected papers from PODC 2010 (2012) (0)
Byzantine Fireflies Rachid Guerraoui (2015) (0)
Disjoint-Access Parallelism Does Not Entail Scalability (2014) (0)
Experiences with Object Group Systems : GARF , Bast and OGS (2007) (0)
A Classification of Various Approches for Parallel and Distributed Programming (1996) (0)
Chop Chop: Byzantine Atomic Broadcast to the Network Limit (2023) (0)
Tradeoffs in Event Systems (2007) (0)
& CHAPTER 2 Tolerating Arbitrary Failures With State Machine Replication (2005) (0)
Fatal Brain Damage (2019) (0)
A Lower Bound for Total Order Broadcast (2005) (0)
Stochastic Parrots Looking for Stochastic Parrots: LLMs are Easy to Fine-Tune and Hard to Detect with other LLMs (2023) (0)
Special issue: High availability in CORBA (1998) (0)
The Cost of Obstruction-Freedom ∗ (2007) (0)
CoRNG: Concurrency as a Random Number Generator (2016) (0)
Abstractions for Distributed Programming: Guests or Relatives? (2001) (0)
On the Smallest Grain of Salt to Get a Unique Identity (2017) (0)
Universal constructions (2020) (0)
Five Concurrency Control Requirement for Shared Objects (1993) (0)
Workshop on Reliable Middleware - Foreword (1999) (0)
Democratizing the Parliament (extended Abstract) (2001) (0)
Byzantine Agreement with Homonyms (Accord Byzantin avec des Homonymes) (2012) (0)
Programming with Transactional Memory (2017) (0)
A Thrifty Universal Construction (2015) (0)
The notions of time and global state in a distributed system (2019) (0)
11 Asynchronous Gossip (2013) (0)

This paper list is powered by the following services:

Other Resources About Rachid Guerraoui

en.wikipedia.org

What Schools Are Affiliated With Rachid Guerraoui?

Rachid Guerraoui is affiliated with the following schools: