Publication

A formal approach to fault tolerant distributed consensus

About
Privacy
Disclaimer

Graph Chatbot

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.

Publications related to A formal approach to fault tolerant distributed consensus | EPFL Graph Search

A formal approach to fault tolerant distributed consensus

Graph Chatbot

Chat with Graph Search

Molecular hypergraph neural networks

Exact Obstacle Avoidance for Robots in Complex and Dynamic Environments Using Local Modulation

Energy Management of Price-Maker Community Energy Storage by Stochastic Dynamic Programming

Performing and Detecting Backdoor Attacks on Face Recognition Algorithms

On the Theory and Practice of Modern Secure Messaging

Hypergraph-Based Fast Distributed AC Power Flow Optimization

Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search

Bayesian reconstruction of memories stored in neural networks from their connectivity

Results on Sparse Integer Programming and Geometric Independent Sets

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!