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

This graduate-level text gives a thorough overview of the analysis of Boolean functions, beginning with the most basic definitions and proceeding to advanced topics.

We survey several techniques for proving lower bounds in Boolean, algebraic, and communication complexity based on certain linear algebraic approaches.

This is leading to a new understanding of the structure of these problems, and of how algorithms perform on them.

This monograph surveys lower bounds in the field of communication complexity. Our focus is on lower bounds that work by first representing the communication complexity measure in Euclidean space.

Algorithmic Results in List Decoding introduces and motivates the problem of list decoding, and discusses the central algorithmic results of the subject, culminating with the recent results on achieving "list decoding capacity.

The text is supplemented by a large number of exercises and new results.

Mathematics of Computing -- Numerical Analysis.

This is a concise, up-to-date introduction to extremal combinatorics for non-specialists.

This book presents a coherent and unified treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized algorithms.