Book of Donmon Teith

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

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

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

The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen tal compl

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