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 …

Communication complexity is the mathematical study of scenarios where several parties
need to communicate to achieve a common goal, a situation that naturally appears during …

Motivated by a problem of transmitting supplemental data over broadcast channels (Birk and
Kol, INFOCOM 1998), we study the following coding problem: a sender communicates with n …

Boolean circuit complexity is the combinatorics of computer science and involves many
intriguing problems that are easy to state and explain, even for the layman. This book is a …

The problem of constructing optimal and near-optimal test sequences to diagnose
permanent faults in electronic and electromechanical systems is considered. The test …

From the winner of the Turing Award and the Abel Prize, an introduction to computational
complexity theory, its connections and interactions with mathematics, and its central role in …

We describe new ways to simulate 2-party communication protocols to get protocols with
potentially smaller communication. We show that every communication protocol that …

We study differential privacy in a distributed setting where two parties would like to perform
analysis of their joint data while preserving privacy for both datasets. Our results imply …

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 …

We examine the communication required for generating random variables remotely. One
party Alice is given a distribution D, and she has to send a message to Bob, who is then …