Intense recent discussions have focused on how to provide individuals with control over
when their data can and cannot be used---the EU's Right To Be Forgotten regulation is an …

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 …

Modern machine learning models are complex and frequently encode surprising amounts of
information about individual inputs. In extreme cases, complex models appear to memorize …

In the data stream scenario, input arrives very rapidly and there is limited memory to store
the input. Algorithms have to work with one or few passes over the data, space less than …

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 …

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 …

A zk-SNARK is a powerful cryptographic primitive that provides a succinct and efficiently
checkable argument that the prover has a witness to a public NP statement, without …

We study the verification problem in distributed networks, stated as follows. Let H be a
subgraph of a network G where each vertex of G knows which edges incident on it are in H …

Greedy algorithms are practitioners' best friends—they are intuitive, are simple to implement,
and often lead to very good solutions. However, implementing greedy algorithms in a …

The problem of finding locally dense components of a graph is an important primitive in data
analysis, with wide-ranging applications from community mining to spam detection and the …