A distributed algorithm $${\mathcal {A}}$$ A solves the Point Convergence task if an arbitrarily large collection of entities, starting in an arbitrary configuration, move under the control of $${\mathcal {A}}$$ A to eventually form and thereafter …

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 …

How to efficiently and reliably spread information in a system is one of the most fundamental problems in distributed computing. Recently, inspired by biological scenarios, several works focused on identifying the minimal communication resources …

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$$ f < n / 3 …

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

We describe a simple deterministic $$O( \varepsilon ^{-1} \log \Delta )$$ O ( ε - 1 log Δ ) round distributed algorithm for $$(2\alpha +1)(1 + \varepsilon )$$ ( 2 α + 1 ) ( 1 + ε ) approximation of minimum weighted dominating set on graphs with …