Previous Conferences & Workshops

In many distributed systems, the cost of computation is dominated by the cost of communication between the machines participating in the computation. Communication complexity is therefore a very useful tool in understanding distributed computation...

A continuous representation of a profinite group induces a continuous pseudorepresentation, where a pseudorepresentation is the data of the characteristic polynomial coefficients. We discuss the geometry of the resulting map from the moduli formal...

I present a new, fully anisotropic, criterion for formation of trapped surfaces in vacuum obtained in collaboration with J. Luk and I. Rodnianski. We provide conditions on null data, concentrated in a neighborhood of a short null geodesic segment...

We study algorithms for combinatorial market design problems, where a collection of objects are priced and sold to potential buyers subject to equilibrium constraints. We introduce the notion of a combinatorial Walrasian equilibium (CWE) as a...

We present practically efficient methods for proving correctness of announced results of a computation while keeping input and intermediate values information theoretically secret. These methods are applied to solve the long standing problem of...

The talk is based on a recent work of M. Avdeeva (Princeton University), D. Li (IAS) and Ya. G. Sinai (Princeton University). We consider some new probability distributions related to the Mobius function and discuss their statistical properties. A...

I will describe work with Yingkun Li on some arithmetic properties of the Fourier coefficients of harmonic modular forms of weight one. These are Maass forms of weight one whose eigenvalue under the Laplacian is zero and that are allowed to have...