Previous Conferences & Workshops

We present a deterministic algorithm for graph connectivity that uses the minimal amount of memory possible, up to a constant factor. Specifically, the algorithm's memory is comparable to that needed to store only a single node of the graph (i.e...

This talk is motivated by some recent work of Bourgain- rezis-Mironescu. A few years ago, they introduced an elementary way of defining the Sobolev spaces $W^{1,p}$ without making any use of derivatives. I will present their definition and some...

We'll start by exhibiting volume-minimizing properties for certain isotropic submanifolds in complex projective spaces via integral geometry. This will lead us to a problem of finding the infimum of areas for isotropic surfaces with a given boundary...

We introduce a new graph parameter, called the rothendieck constant of a graph. This parameter is a generalization of the classical Grothendieck constant; and it is equal to an integrality gap of a certain SDP problem, which has various algorithmic...