Distributed Computing

We present near-optimal algorithms for detecting small vertex cuts in the $\mathsf{CONGEST}$ model of distributed computing. Despite extensive research in this area, our understanding of the vertex connectivity of a graph is still incomplete, especially in ...$\mathrm{}$$\mathrm{}$$\stackrel{}{}$$\mathrm{}$$\stackrel{}{}$${\mathrm{}}^{\mathrm{}}$$\stackrel{}{}$$$$$$\stackrel{}{}$$\mathrm{}$

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most $f<n/3$ failures, any ...$\mathrm{}{}^{\mathrm{}}$$$${}^{\mathrm{}}$$\mathrm{}$$$${}^{\mathrm{}}$$$

This paper considers the good-case latency of Byzantine Reliable Broadcast (BRB), i.e., the time taken by correct processes to deliver a message when the initial sender is correct. This time plays a crucial role in the performance of practical ...$\mathrm{}$$\mathsf{}\mathrm{}\mathrm{}$$\mathsf{}\mathrm{}\mathrm{}$$$$$

The implementation of registers from (potentially) weaker registers is a classical problem in the theory of distributed computing. Since Lamport’s pioneering work (Lamport in Distrib Comput 1(2):77–101, 1986), this problem has been extensively ...$\mathrm{}$

Byzantine state-machine replication (SMR) ensures the consistency of replicated state in the presence of malicious replicas and lies at the heart of the modern blockchain technology. Byzantine SMR protocols often guarantee safety under all ...