Previous Conferences & Workshops

We present a tradeoff between the length of a 3-query probabilistically checkable proof of proximity (PCPP) and the best possible soundness obtained by querying it. Consider the task of distinguishing between "good" inputs w \in {0,1}^n that are...

In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by Black, Rogaway, and Shrimpton in the context of randomized encryption...

This is the first in a series of (probably) three talks whose goal is to understand Faltings’ paper "A p-adic Simpson correspondence". Roughly speaking, this is a correspondence between Higgs bundles over a smooth proper curve X over the field of p...

Equivariant localization relates the geometry of a space to the geometry of the fixed points of a group action. A categorified application of this technique allows one to recover D-modules on a smooth space from coherent sheaves on its loop space...

In the past few years there has been much excitement, and many positive and negative results, regarding the computation of equilibria in games. The problem of finding Nash equilibria in games was shown intractable, there is an on-going race of...

We prove strong lower bounds for Sherali-Adams relaxations of the MAX CUT, Vertex Cover and Sparsest Cut problems. Specifically, we show that the integrality gap of MAX CUT and Vertex Cover relaxations is 2-$\epsilon$ after n^delta rounds (where...

This will be a relaxed, very elementary introduction to the central ideas and applications of derived algebraic geometry. My objective is to describe the Artin-Lurie Representability Theorem, and to give a number of interesting examples.