Publications related to The Time-Complexity of Local Decision in Distributed Agreement

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.

Paradoxical Evidence Integration in Rapid Decision Processes

Michael Herzog, Wulfram Gerstner, Johannes Rüter, Nicolas Marcille

Decisions about noisy stimuli require evidence integration over time. Traditionally, evidence integration and decision making are described as a one-stage process: a decision is made when evidence for the presence of a stimulus crosses a threshold. Here, w ...

Public Library of Science2012

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

The complexity of robust atomic storage

Rachid Guerraoui, Marko Vukolic

We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolerating the largest possible number t of Byzantine storage component failures ( ...

ACM Press2011

Distributed classification of multiple observation sets by consensus

Pascal Frossard, Effrosyni Kokiopoulou

We consider the problem of distributed classification of multiple observations of the same object that are collected in an ad hoc network of vision sensors. Assuming that each sensor captures a different observation of the same object, the problem is to cl ...

Institute of Electrical and Electronics Engineers2011

The Complexity Of Early Deciding Set Agreement

Rachid Guerraoui, Bastian Pochon

In the k-set agreement problem, each processor starts with a private input value and eventually decides on an output value. At most k distinct output values may be chosen, and every processor's output value must be one of the proposed values. We consider a ...

Society for Industrial and Applied Mathematics2011

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

André Schiper, Martin Hutle, Zarko Milosevic

We investigate the reduction of atomic broadcast to consensus in systems with Byzantine faults. Among the several definitions of Byzantine consensus that differ only by their validity property, we identify those equivalent to atomic broadcast. Finally, we ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2011

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

André Schiper, Martin Hutle, Zarko Milosevic

2011

Quantitative Analysis of Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran, Nuno Filipe de Sousa Santos

Consensus is one of the key problems in fault-tolerant distributed computing. Although the solvability of consensus is now a well-understood problem, comparing different algorithms in terms of efficiency is still an open problem. In this paper, we address ...

2011

The Time-Complexity of Local Decision in Distributed Agreement

Graph Chatbot

Chat with Graph Search

Paradoxical Evidence Integration in Rapid Decision Processes

Generating Fast Indulgent Algorithms

The complexity of robust atomic storage

Distributed classification of multiple observation sets by consensus

Models of Evidence Integration in Rapid Decision Making Processes

The dynamics of perceptual decision making

The Complexity Of Early Deciding Set Agreement

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

Quantitative Analysis of Consensus Algorithms

Paradoxical Evidence Integration in Rapid Decision Processes

The complexity of robust atomic storage

Generating Fast Indulgent Algorithms

The Complexity Of Early Deciding Set Agreement

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

Models of Evidence Integration in Rapid Decision Making Processes

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

Distributed classification of multiple observation sets by consensus

The dynamics of perceptual decision making

Quantitative Analysis of Consensus Algorithms