Publications by Rachid Guerraoui

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Federated learning (FL) is an appealing paradigm that allows a group of machines (a.k.a. clients) to learn collectively while keeping their data local. However, due to the heterogeneity between the clients' data distributions, the model obtained through th ...

To increase their dependability, distributed control systems (DCSs) need to agree in real time about crashed hosts, i.e., they need a real-time membership service. In this paper, we prove that such a service cannot be implemented deterministically if, besi ...

Transactional memory (TM) is a promising paradigm for concurrent programming. This paper is an overview of our recent theoretical work on defining a theory of TM. We first recall some TM correctness properties and then overview results on the inherent powe ...

Gossip-based communication protocols are often touted as being robust. Not surprisingly, such a claim relies on assumptions under which gossip protocols are supposed to operate. In this paper, we discuss and in some cases expose some of these assumptions a ...

This paper addresses the following question: what is the minimum-sized synchronous window needed to solve consensus in an otherwise asynchronous system? In answer to this question, we present the first optimally-resilient algorithm ASAP that solves consens ...

We consider the polling problem in a social network: participants express support for a given option and expect an outcome reflecting the opinion of the majority. Individuals in a social network care about their reputation: they do not want their vote to b ...

This paper addresses the problem of combining Byzantine resilience with privacy in machine learning (ML). Specifically, we study if a distributed implementation of the renowned Stochastic Gradient Descent (SGD) learning algorithm is feasible with both diff ...

Rachid Guerraoui

Chat with Graph Search

Democratizing Transactional Programming

StreamFlex - High-throughput Stream Programming in Java

Fine-Tuning Personalization in Federated Learning to Mitigate Adversarial Clients

Brief Announcement: Towards Secured Distributed Polling in Social Networks

Personalized and Private Peer-to-Peer Machine Learning

WHO'S ON BOARD? Probabilistic Membership for Real-Time Distributed Control Systems

How Fast Can Eventual Synchrony Lead to Consensus?

Transactional Memory: Glimmer of a Theory

How robust are gossip-based communication protocols?

How to solve consensus in the smallest window of synchrony

Optimal Fair Computation

Decentralized polling with respectable participants

To Transmit Now or Not to Transmit Now

Hierarchical Probabilistic Multicast

Differential Privacy and Byzantine Resilience in SGD: Do They Add Up?

Reducing the Cost for Non-Blocking in Atomic Commitment

Atomic Object Composition

Protocol Classes for Designing Reliable Distributed Environments

Toward Modular Concurrency Control for Object-Oriented Distributed Systems

Garf: a tool for programming reliable distributed applications