We show how to efficiently simulate the sending of a single message M to a receiver who
has partial information about the message, so that the expected number of bits …

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 …

We show optimal lower bounds for spanning forest computation in two different models: One
wants a data structure for fully dynamic spanning forest in which updates can insert or delete …

We show an exponential gap between communication complexity and information
complexity, by giving an explicit example for a communication task (relation), with …

A strong direct product theorem for a problem in a given model of computation states that, in
order to compute k instances of the problem, if we provide resource which is less than k …

We generalize the deterministic simulation theorem of Raz & McKenzie (Combinatorica 19
(3): 403–435, 1999), to any gadget which satisfies a certain hitting property. We prove that …

We give a direct product theorem for the entanglement-assisted interactive quantum
communication complexity in terms of the quantum partition bound for product distributions …

We show an exponential gap between communication complexity and information
complexity by giving an explicit example of a partial boolean function with information …

We precisely characterize the role of private randomness in the ability of Alice to send a
message to Bob while minimizing the amount of information revealed to him. We give an …

We prove a lower bound on the communication complexity of computing the n-fold xor of an
arbitrary function f, in terms of the communication complexity and rank of f. We prove that …