Physical location is an important attribute of a sensorâ€™s data stream in a large number of sensor network applications. In addition, geographic information, for instance in the form of nodeâ€¦ (More)

We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in-flow constraints on vertices. Deciding whether this simple graphâ€¦ (More)

We consider a router on the Internet analyzing the statistical properties of a TCP/IP packet stream. A fundamental difficulty with measuring traffic behavior on the Internet is that there is simplyâ€¦ (More)

This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, we turn our attentionâ€¦ (More)

We develop a new technique for proving cell-probe lower bounds on dynamic data structures. This technique enables us to prove an amortized randomized (lg n) lower bound per operation for several dataâ€¦ (More)

We consider the following general correlation-clustering problem [1]: given a graph with real nonnegative edge weights and a ã€ˆ+ã€‰/ã€ˆâˆ’ã€‰ edge labeling, partition the vertices into clusters to minimizeâ€¦ (More)

We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multi-path connectivity (k-connectivity) between all nodes. Such a guarantee simultaneouslyâ€¦ (More)

Motivated by boolean queries in text database systems, we consider the problems of nding the intersection, union, or diierence of a collection of sorted sets. While the worst-case complexity of theseâ€¦ (More)