Distributed Computing

Population protocols are a model of computation in which an arbitrary number of indistinguishable finite-state agents interact in pairs. The goal of the agents is to decide by stable consensus whether their initial global configuration satisfies a ...$$$\mathcal{}$$\mathcal{}$$$$\mathrm{}$

We give a protocol for Asynchronous Distributed Key Generation (A-DKG) that is optimally resilient (can withstand $\mathit{f}<\frac{\mathit{n}}{\mathbf{3}}$ faulty parties), has a constant expected number of rounds, has $\mathit{O}(\mathit{\lambda }{\mathit{n}}^{\mathbf{3}})$ expected communication complexity, and assumes only the ...$\mathbf{}\mathit{}$$\mathbf{}{\mathit{}}^{\mathrm{}}$

Current-day data centers and high-volume cloud services employ a broad set of heterogeneous servers. In such settings, client requests typically arrive at multiple entry points, and dispatching them to servers is an urgent distributed systems ...

Consider any locally checkable labeling problem $\mathrm{\Pi }$ in rooted regular trees: there is a finite set of labels $\mathrm{\Sigma }$, and for each label $x\in \mathrm{\Sigma }$ we specify what are permitted label combinations of the children for an internal node of label x (the leaf nodes ...$\mathrm{}$$\mathrm{}{}^{}$$\mathrm{}$${}^{\mathrm{}\mathrm{}}$$\mathsf{}$$\mathsf{}$$\mathsf{}$$\mathsf{}$$\mathrm{}$$\mathrm{}$$\mathrm{}$$\mathrm{}{}^{}$$\mathrm{}$${}^{\mathrm{}\mathrm{}}$$\mathrm{}$

This article shows how to construct an overlay network of constant degree and diameter $O(logn)$ in $O(logn)$ time starting from an arbitrary weakly connected graph. We assume a synchronous communication network in which nodes can send messages to ...$$$$${}^{\mathrm{}\mathrm{}}$$$$\mathrm{}$$$$$

Most modern asset transfer systems use consensus to maintain a totally ordered chain of transactions. It was recently shown that consensus is not always necessary for implementing asset transfer. More efficient, asynchronous solutions can be built ...

We consider networks of small, autonomous devices that communicate with each other wirelessly. Minimizing energy usage is an important consideration in designing algorithms for such networks, as battery life is a crucial and limited resource. ...$\mathrm{}$$\mathrm{}$$\mathrm{}$$\mathrm{}$

Graph spanners and emulators are sparse structures that approximately preserve distances of the original graph. While there has been an extensive amount of work on additive spanners, so far little attention was given to weighted graphs. Only very ...${}^{\mathrm{}\mathrm{}}$${}^{\mathrm{}\mathrm{}}$$\mathrm{}$$\mathrm{}$$\mathrm{}{}_{}$${}_{}$$$$\mathrm{}{}_{\mathit{}}$${}^{\mathrm{}\mathrm{}}$${}_{\mathit{}}$$\mathrm{}$${}^{\mathrm{}\mathrm{}}$$\mathrm{}$${}^{\mathrm{}\mathrm{}}$$\mathrm{}$$\sqrt{}$$\mathrm{}{}_{\mathit{}}$$\mathrm{}$$\stackrel{}{}{}^{\mathrm{}\mathrm{}}$$\stackrel{}{}\sqrt{}$$\mathrm{}$$\stackrel{}{}{}^{\mathrm{}\mathrm{}}$$\stackrel{}{}{}^{\mathrm{}}$

The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects ...