• Publications
  • Influence
Submodular Maximization Meets Streaming: Matchings, Matroids, and More
TLDR
We study the problem of finding a maximum matching in a graph given by an input stream listing its edges in some arbitrary order, where the quantity to be maximized is given by a monotone submodular function on subsets of edges. Expand
  • 71
  • 18
  • PDF
Near-optimal lower bounds on the multi-party communication complexity of set disjointness
TLDR
We study the communication complexity of the set disjointness problem in the general multiparty model and the one-way communication model. Expand
  • 199
  • 15
  • PDF
Improved Approximation Algorithms for Resource Allocation
TLDR
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 of available resource. We show that this NP-hard Resource Allocation problem can be (1/2-?)-approximated in polynomial time. Expand
  • 95
  • 14
  • PDF
A quasi-PTAS for unsplittable flow on line graphs
TLDR
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. Expand
  • 93
  • 13
  • PDF
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
TLDR
We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied gap-hamming-distance problem. Expand
  • 124
  • 11
Approximation Algorithms for the Unsplittable Flow Problem
TLDR
We present approximation algorithms for the unsplittable flow problem (UFP) in undirected graphs in which the edge capacities can vary arbitrarily over the graph. Expand
  • 134
  • 10
  • PDF
Informational complexity and the direct sum problem for simultaneous message complexity
TLDR
We introduce a new notion of informational complexity which is related to SM complexity and has nice direct sum properties in the simultaneous message (SM) model. Expand
  • 263
  • 9
  • PDF
A near-optimal algorithm for computing the entropy of a stream
TLDR
We describe a simple algorithm for approximating the empirical entropy of a stream of <i>m</i> values in a single pass, using a space lower bound of Ω(ε<sup>-2</sup> log(Δ<Sup>-1</sup>) words of space. Expand
  • 128
  • 9
  • PDF
Functional Monitoring without Monotonicity
TLDR
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi to initiate a formal study of the communication cost of certain fundamental problems arising in distributed systems. Expand
  • 85
  • 9
  • PDF
An optimal randomised cell probe lower bound for approximate nearest neighbour searching
TLDR
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1 }/sup d/. Expand
  • 68
  • 8
  • PDF