We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of sizen, we establish a near-optimal lowerâ€¦ (More)

Givenm copies of the same problem, does it take m times the amount of resources to solve these m problems? This is the direct sum problem, a fundamental question that has been studied in manyâ€¦ (More)

We study the problem of finding a most profitable subset of n given tasks, each with a given start and finish time as well as profit and resource requirement, that at no time exceeds the quantity Bâ€¦ (More)

We describe a simple algorithm for approximating the empirical entropy of a stream of <i>m</i> values in a single pass, using <i>O</i>(Îµ<sup>-2</sup> log(Î”<sup>-1</sup>) log <i>m</i>) words of space.â€¦ (More)

We present approximation algorithms for the unsplittable flow problem (UFP) in undirected graphs. As is standard in this line of research, we assume that the maximum demand is at most the minimumâ€¦ (More)

We study the Unsplittable Flow Problem (UFP) on line graphs and cycles, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-polynomialâ€¦ (More)

The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [4] to initiate a formal study of the communication cost of certain fundamental problemsâ€¦ (More)

We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1 }/sup d/. We show that a randomised cell probe algorithm that uses polynomial storage and word size d/sup O(1)/â€¦ (More)