With the rise of dynamic reconfigurable networks such as Peer-to-Peer (P2P) networks,
overlay networks, ad hoc wireless and mesh networks, it has become important to construct …

Existing compact routing schemes, eg, Thorup and Zwick [SPAA 2001] and Chechik [PODC
2013], often have no means to tolerate failures, once the system has been setup and started …

The paper (Compact Routing Messages in Self-Healing Trees, TCS 2017) introduced
CompactFTZ, the first self-healing compact routing algorithm that works in a distributed …

We also present a lower bound of Θ (log n) rounds on average, for any distributed expander
self-healing algorithm. This shows that our algorithms are asymptotically the best possible …

The discipline of distributed computing and algorithms is concerned with what can be
achieved by interacting agents with limited local knowledge. This is a vital question in the …

From data centers to IoT devices to Internet-based applications, overlay networks have
become an important part of modern computing. Many of these overlay networks operate in …

Today's distributed systems exist on a scale that was unimaginable only a few decades ago.
Distributed systems now can consist of thousands or even millions of computers spread …

This paper seeks to address the question of designing distributed algorithms for the setting
of compact memory ie sublinear bits working memory for arbitrary connected networks. The …