Cyber-physical systems (CPSs) are the next generation of engineered systems in which
computing, communication, and control technologies are tightly integrated. Research on …

This beginning graduate textbook describes both recent achievements and classical results
of computational complexity theory. Requiring essentially no background apart from …

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 …

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 …

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 …

Refactorings are behavior-preserving program transformations that automate design
evolution in object-oriented applications. Three kinds of design evolution are: schema …

The notion of L p sampling, and corresponding algorithms known as L p samplers, has
found a wide range of applications in the design of data stream algorithms and beyond. In …

A one-way function is a function that is easy to compute but hard to invert* on average*. We
establish the first characterization of a one-way function by* worst-case* hardness …

For a constant ϵ, we prove a (N) lower bound on the (randomized) communication
complexity of ϵ-Nash equilibrium in two-player N x N games. For n-player binary-action …