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

Surveys the mathematical theory and applications such as computer networks, VLSI circuits, and data structures.

The communication complexity of a function f(x, y) measures the number of bits that two players, one who knows x and the other who knows y, must exchange to det

This book constitutes the refereed conference proceedings of the 28th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2

This book deals mostly with impossibility results - lower bounds on what can be accomplished by algorithms. However, the perspective is unapologetically that of