We use exponential sums to analyze the Fourier spectrum of functions of the type MOD_m^A (with output in {-1, 1}), for any constant m, and a general accepting set A.  We will then see how this yields lower bounds on the number of monomials require

Garbled circuits are a central primitive in cryptography. Intuitively, a garbled circuit enables its holder to evaluate a circuit on an input, so that the evaluator learns the output but learns nothing about the circuit or the input.

We study the logistics system of eukaryotic cells, whose warehouses are micron-scale "organelles" and whose trucks are 10-nanometer-scale "vesicles". Organelles form the nodes and vesicle fluxes form the edges of a transport graph.

A boolean circuit is a natural model of computation for Boolean functions. Size and Depth of a circuit are two measures of complexity of the circuit.

We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization.