We present a new method for proving strong lower bounds in communication complexity.
This method is based on the notion of the conditional information complexity of a function …

In this paper we present a simple but powerful subgraph sampling primitive that is
applicable in a variety of computational models including dynamic graph streams (where the …

We present several results regarding randomized one-round communication complexity.
Our results include a connection to the VC-dimension, a study of the problem of computing …

We study the communication complexity of the set disjointness problem in the general
multiparty model. For t players, each holding a subset of a universe of size n, we establish a …

We present a technical survey on the state of the art approaches in data reduction and the
coreset framework. These include geometric decompositions, gradient methods, random …

The primary goal of this paper is to define and study the interactive information complexity of
functions. Let f (x, y) be a function, and suppose Alice is given x and Bob is given y …

In this paper, we address the problem of\emphcorrelation clustering in the dynamic data
stream model. The stream consists of updates to the edge weights of a graph on n nodes …

We give the first exponential separation between quantum and bounded-error randomized
one-way communication complexity. Specifically, we define the Hidden Matching Problem …

A growing body of work addresses the challenge of processing dynamic graph streams: a
graph is defined by a sequence of edge insertions and deletions and the goal is to construct …

We revisit the much-studied problem of space-efficiently estimating the number of triangles
in a graph stream, and extensions of this problem to counting fixed-sized cliques and cycles …