We consider the problem of computing shortest paths in hybrid networks, in which nodes
can make use of different communication modes. For example, mobile phones may use ad …

Performing computation in the presence of faulty and malicious nodes is a central problem
in distributed computing. Over 35 years ago, Dwork, Peleg, Pippenger, and Upfal [STOC …

We show how to construct an overlay network of constant degree and diameter O (log n) in
time O (log n) starting from an arbitrary weakly connected graph. We assume a synchronous …

In this paper, we study distributed graph algorithms in networks in which the nodes have a
limited communication capacity. Many distributed systems are built on top of an underlying …

We study graph realization problems for the first time from a distributed perspective. Graph
realization problems are encountered in distributed construction of overlay networks that …

We consider the problem of transforming any weakly connected overlay network of
polylogarithmic degree into a topology of logarithmic diameter. The overlay network is …

In this paper, we study the graph realization problem in the Congested Clique model of
distributed computing under crash faults. We consider degree-sequence realization, in …

We study robust and efficient distributed algorithms for building and maintaining distributed
data structures in dynamic Peer-to-Peer (P2P) networks. P2P networks are characterized by …

We consider the problem of constructing distributed overlay networks, where nodes in a
reconfigurable system can create or sever connections with nodes whose identifiers they …

In recent years, the explosion of big data and analytics has necessitated distributed storage
and processing with several compute nodes (eg, multiple datacenters). These nodes …