This book provides a central source of reference on the various data management
techniques of large scale data processing and its technology application. This book presents …

This paper presents improved deterministic distributed algorithms, with O (log n)-bit
messages, for some basic graph problems. The common ingredient in our results is a …

This paper presents efficient distributed algorithms for a number of fundamental problems in
the area of graph sparsification: We provide the first deterministic distributed algorithm that …

Graph spanners are sparse subgraphs that faithfully preserve the distances in the original
graph up to small stretch. Spanner have been studied extensively as they have a wide range …

We address the fundamental network design problem of constructing approximate minimum
spanners. Our contributions are for the distributed setting, providing both algorithmic and …

Given a pair of parameters α≥ 1, β≥ 0, a subgraph G'=(V, H) of an n-vertex unweighted
undirected graph G=(V, E) is called an (α, β)-spanner if for every pair u, ν∈ V of vertices, we …