We show how to efficiently construct a small probability space on n binary random variables
such that for every subset, its parity is either zero or one with" almost" equal probability. They …

Chernoff–Hoeffding (CH) bounds are fundamental tools used in bounding the tail
probabilities of the sums of bounded and independent random variables (rv's). We present a …

We introduce a new method, called priority encoding transmission, for sending messages
over lossy packet-based networks. When a message is to be transmitted, the user specifies …

Discrepancy theory is also called the theory of irregularities of distribution. Here are some
typical questions: What is the" most uniform" way of dis tributing n points in the unit square …

You can start by putting the DO NOT DISTURB sign. Cay, in Desert Hearts (1985). The
interplay between randomness and computation is one of the most fas cinating scientific …

We show that for all large n, every n-uniform hypergraph with at most equation image edges
can be 2-colored. This makes progress on a problem of Erdös [Nordisk Mat. Tidskrift 11, 5 …

We present the first explicit construction of Probabilistically Checkable Proofs (PCPs) and
Locally Testable Codes (LTCs) of fixed constant query complexity which have almost-linear …

We present three explicit constructions of hash functions, which exhibit a trade-off between
the size of the family(and hence the number of random bits needed to generate a member of …

We consider testing and learning problems on causal Bayesian networks as defined by
Pearl (Pearl, 2009). Given a causal Bayesian network M on a graph with n discrete variables …

We consider the problem of designing fundamental graph algorithms on the model of
Massive Parallel Computation (MPC). The input to the problem is an undirected graph G …