Add to ORKGThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987.Vita.Bibliography: p. 145-149.by Brian A. Coan.Ph.D
We present a new abstraction to replace the $t$ of $n$ assumption used in designing fault-tolerant ...
Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and liveness...
Distributed Consensus is a classical problem in distributed computing. It requires the correct proc...
PhD ThesisThis thesis describes the design and development of algorithms for fault tolerant distr...
AbstractA consensus protocol enables a system of n asynchronous processes, some of them faulty, to r...
This paper presents a formal veriffication of two consensus protocols for distributed systems presen...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Fault-tolerant computing is the art and science of building computer systems that continue to operat...
This thesis presents steps towards simplifying the implementation of robust high performance distrib...
This paper presents a new type of Consensus problem named the Consensus (n, m) with alternative plan...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
International audienceProviding application processes with strong agreement guarantees despite failu...
International audienceConsensus is the paradigmatic problem in fault-tolerant distributed computing:...
A distributed system is a collection of autonomous processors which communicate with each other via ...
[[abstract]]To solve the consensus problem, the classical consensus protocols require t+1 rounds of ...
We present a new abstraction to replace the $t$ of $n$ assumption used in designing fault-tolerant ...
Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and liveness...
Distributed Consensus is a classical problem in distributed computing. It requires the correct proc...
PhD ThesisThis thesis describes the design and development of algorithms for fault tolerant distr...
AbstractA consensus protocol enables a system of n asynchronous processes, some of them faulty, to r...
This paper presents a formal veriffication of two consensus protocols for distributed systems presen...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Fault-tolerant computing is the art and science of building computer systems that continue to operat...
This thesis presents steps towards simplifying the implementation of robust high performance distrib...
This paper presents a new type of Consensus problem named the Consensus (n, m) with alternative plan...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
International audienceProviding application processes with strong agreement guarantees despite failu...
International audienceConsensus is the paradigmatic problem in fault-tolerant distributed computing:...
A distributed system is a collection of autonomous processors which communicate with each other via ...
[[abstract]]To solve the consensus problem, the classical consensus protocols require t+1 rounds of ...
We present a new abstraction to replace the $t$ of $n$ assumption used in designing fault-tolerant ...
Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and liveness...
Distributed Consensus is a classical problem in distributed computing. It requires the correct proc...