Previous Conferences & Workshops

In theoretical computer science, we often aim to prove lower bounds and demonstrate the computational hardness of solving certain problems. However, some of these "negative" results can be directly applied to cryptography, to base the security of...

The Brascamp-Lieb inequality is a fundamental inequality in analysis, generalizing more classical inequalities such as Holder's inequality, the Loomis-Whitney inequality, and Young's convolution inequality: it controls the size of a product of...

The Gowers uniformity k-norm on a finite abelian group measures the averages of complex functions on such groups over k-dimensional arithmetic cubes. The inverse question about these norms asks if a large norm implies correlation with a function of...

We show that for every positive integer k there are positive constants C and c such that if A is a subset of {1, 2, ..., n} of size at least C n^{1/k}, then, for some d \leq k-1, the set of subset sums of A contains a homogeneous d-dimensional...

Randomness is a vital resource in computation, with many applications in areas such as cryptography, data-structures and algorithm design, sampling, distributed computing, etc. However generating truly random bits is expensive, and most sources in...

Borel proved that any holomorphic map from an affine complex algebraic curve to a Shimura variety (with sufficient level structure) must be algebraic. We will discuss a p-adic analogue of this theorem. This is joint work with Abhishek Oswal and...

A quasigeodesic in a manifold is a curve so that when lifted to the universal cover is uniformly efficient up to a bounded multiplicative and added error in measuring length. A flow is quasigeodesic if all flow lines are quasigeodesics. We prove...

In the minimum cost set cover problem, a set system is given as input, and the goal is to find a collection of sets with minimum cost whose union covers the universe. This NP-hard problem has long been known to admit logarithmic approximations...