In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing,
and analyzing distributed algorithms. She directs her book at a wide audience, including …

In this paper we explore some implications of viewing graphs as geometric objects. This
approach offers a new perspective on a number of graph-theoretic and algorithmic …

The generation of RDF data has accelerated to the point where many data sets need to be
partitioned across multiple machines in order to achieve reasonable performance when …

In this paper, we establish max-flow min-cut theorems for several important classes of
multicommodity flow problems. In particular, we show that for any n-node multicommodity …

This paper provides a novel technique for the analysis of randomized algorithms for
optimization problems on metric spaces, by relating the randomized performance ratio for …

We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern
of constant size. Our results are based on a technique of partitioning the planar graph into …

We improve the result of [BartSG] on probabilistic approximation of metric spaces by
“hierarchically wellseparated tree” metric spaces. We obtain an approximation factor of O …

Consider a set of shared objects in a distributed network, where several copies of each
object may exist at any given time. To ensure both fast access to the objects as well as …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

Delivering messages between pairs of processors is a basic and primary activity of any
distributed communication network. This task is performed using a routing scheme, which is …