Publication

A Topological Treatment of Early-Deciding Set-Agreement

Rachid Guerraoui
2009
Journal Articles

Abstract

The k-set-agreement problem consists for a set of n processes to agree on less than k among n possibly different Values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus problem.

Official source

Graph Chat

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.

A Topological Treatment of Early-Deciding Set-Agreement

Chat with Graph Search

Hitting with Probability One for Stochastic Heat Equations with Additive Noise

Dynamical system approach to navigation around obstacles

Reliable data-driven decision-making through optimal transport