Video Lectures

Public Lecture: Ernst Kantorowicz: Institute Events and Some Unpublished Writings of a Towering Twentieth-Century Intellectual Drawing on his recently published, and quickly acclaimed, biography of Ernst Kantorowicz, Robert E. Lerner will recount...

The celebrated Brascamp-Lieb (BL) inequalities are an important mathematical tool, unifying and generalizing numerous inequalities in analysis, convex geometry and information theory, with many used in computer science. I will survey the well...

The Minimum Circuit Size Problem (MCSP) and a related problem (MKTP) that deals with time-bounded Kolmogorov complexity are prominent candidates for NP-intermediate status. We present new results relating the complexity of various approximation...

In the fifties John Nash astonished the geometers with his celebrated isometric embedding theorems. A folkloristic explanation of his first theorem is that you should be able to put any piece of paper in your pocket without crumpling or folding it...

In the fifties John Nash astonished the geometers with his celebrated isometric embedding theorems. A folkloristic explanation of his first theorem is that you should be able to put any piece of paper in your pocket without crumpling or folding it...

Symplectic homology for a Liouville cobordism (possibly filled at the negative end) generalizes simultaneously the symplectic homology of Liouville domains and the Rabinowitz-Floer homology of their boundaries. I intend to explain a conceptual...

We discuss the problem of singularity formation for some of the basic equations of incompressible fluid mechanics such as the incompressible Euler equation and the surface quasi-geostrophic (SQG) equation. We begin by going over some of the...

In the fifties John Nash astonished the geometers with his celebrated isometric embedding theorems. A folkloristic explanation of his first theorem is that you should be able to put any piece of paper in your pocket without crumpling or folding it...

This talk will survey recent progress on program obfuscation from feasibility results to applications in cryptography and complexity theory. We will also describe a simple obfuscation construction based on cryptographic multi-linear maps and give a...