— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...
Scalable Source Routing (SSR) is a self-organizing routing protocol designed for supporting peer-to-peer applications. It is especially suited for networks that do not have a well...
The use of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-toPeer (P2P) Networks. In this paper, we study the performance of Yao-G...
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...