Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give
two new load-balancing protocols whose provable performance guarantees are within a …

RFC 4981: Survey of Research towards Robust Peer-to-Peer Networks: Search Methods [RFC
Home] [TEXT|PDF|HTML] [Tracker] [IPR] [Info page] INFORMATIONAL Network Working Group …

How can we detect fraudulent lockstep behavior in large-scale multi-aspect data (ie,
tensors)? Can we detect it when data are too large to fit in memory or even on a disk? Past …

Data stream processing has recently received increasing attention as a computational
paradigm for dealing with massive data sets. Surprisingly, no algorithm with both sublinear …

In this paper we describe algorithms for computing the Burrows-Wheeler Transform (bwt)
and for building (compressed) indexes in external memory. The innovative feature of our …

The need to deal with massive data sets in many practical applications has led to a growing
interest in computational models appropriate for large inputs. The most important quality of a …

We consider external algorithms for skyline computation without pre-processing. Our goal is
to develop an algorithm with a good worst case guarantee while performing well on …

Any ordering of the nodes of an n-node, m-edge simple undirected graph G defines an
acyclic orientation of the edges in which each edge is oriented from the earlier node in the …

Given an n-node m-edge graph G, the degeneracy of graph G and the associated node
ordering can be computed in linear time in the RAM model by a greedy algorithm that …

In this paper we describe algorithms for computing the BWT and for building (compressed)
indexes in external memory. The innovative feature of our algorithms is that they are …