Publication

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!

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.

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!

Graph Chatbot

Chat with Graph Search

Planetary-Scale Byzantine Fault Tolerance

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

Building Strongly-Consistent Systems Resilient to Failures, Partitions, and Slowdowns

Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Toward Mobile Distributed Ledgers

Data-driven and Safe Networked Control with Applications to Microgrids

Asynchronous distributed coordination and consensus with threshold logical clocks

Rational Agreement in the Presence of Crash Faults

Dynamic Byzantine Reliable Broadcast